Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void selection2Sort(int *A, int n, char smjer) {
- int i, j, min, max;
- if (smjer == '0') {
- for (i = 0; i < n/2 ; i++) {
- min = i;
- max = n - 1-i;
- for (j = i + 1; j < n - 1-i; j++) {
- if (A[min] > A[j]) min = j;
- if (A[max] < A[j]) max = j;
- }
- if (A[max] < A[i]) {
- zamijeni(&A[i], &A[n-i-1]);
- zamijeni(&A[i], &A[min]);
- }
- else {
- if (A[min] > A[n - 1 - i]) {
- zamijeni(&A[n - 1 - i], &A[i]);
- zamijeni(&A[n - 1 - i], &A[max]);
- }
- else {
- zamijeni(&A[min], &A[i]);
- zamijeni(&A[max], &A[n - 1 - i]);
- }
- }
- }
- }
- if (smjer == '1') {
- for (i = 0; i < n / 2; i++) {
- max = i;
- min = n - 1 - i;
- for (j = i + 1; j < n - 1 - i; j++) {
- if (A[min] > A[j]) min = j;
- if (A[max] < A[j]) max = j;
- }
- if (A[max] < A[n - 1 - i]) {
- zamijeni(&A[n - 1 - i], &A[i]);
- zamijeni(&A[n - 1 - i], &A[min]);
- }
- else {
- if (A[min] > A[i]) {
- zamijeni(&A[i], &A[n - 1 - i]);
- zamijeni(&A[i], &A[max]);
- }
- else {
- zamijeni(&A[min], &A[n - 1 - i]);
- zamijeni(&A[max], &A[i]);
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement