Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- void pm(int A[], int n);
- void swap(int *pa, int *pb);
- int pusik(int A[], int n);
- int pusik_r(int A[], int n);
- void main()
- {
- const int n = 8;
- int A[n] = {59, -8, 102, 65, -78, 0, 13, 5};
- pm(A, n);
- pusik(A, n);
- printf("\n");
- int B[n] = { 59, -8, 102, 65, -78, 0, 13, 5 };
- pm(B, n);
- pusik_r(B, n);
- printf("\n");
- getchar();
- }
- void pm(int A[], int n)
- {
- printf("Array: ");
- for (int i = 0; i < n; i++)
- {
- printf("%4d", A[i]);
- }
- printf("\n");
- }
- void swap(int *pa, int *pb)
- {
- int temp = *pa;
- *pa = *pb;
- *pb = temp;
- }
- int pusik_r(int A[], int n)
- {
- int i = 0;
- int check = 1;
- while (i < n - 1)
- {
- if (A[i]>A[i + 1])
- {
- swap(&A[i], &A[i + 1]);
- check = 0;
- }
- pm(A, n);
- i++;
- if (check)
- {
- return 0;
- }
- }
- pusik_r(A, n);
- }
- int pusik(int A[], int n)
- {
- for (int q = 1; q > 0; q++)
- {
- int i = 0;
- int check = 1;
- while (i < n - 1)
- {
- if (A[i]>A[i + 1])
- {
- swap(&A[i], &A[i + 1]);
- check = 0;
- }
- pm(A, n);
- i++;
- if (check)
- {
- return 0;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement