42 lines
791 B
C
42 lines
791 B
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
void f(int t[], uint len) {
|
|
while (len > 1) {
|
|
uint i = 0;
|
|
while (i + 1 < len) {
|
|
if (t[i] > t[i + 1]) {
|
|
t[i] = t[i] ^ t[i + 1];
|
|
t[i + 1] = t[i] ^ t[i + 1];
|
|
t[i] = t[i] ^ t[i + 1];
|
|
}
|
|
i++;
|
|
}
|
|
len--;
|
|
}
|
|
}
|
|
|
|
void print_t(int t[], uint len) {
|
|
if (len == 0) {
|
|
printf("[]");
|
|
return;
|
|
}
|
|
uint i = 1;
|
|
printf("[%d", t[0]);
|
|
while (i < len) {
|
|
printf(", %d", t[i]);
|
|
i++;
|
|
}
|
|
printf("]");
|
|
}
|
|
|
|
int main() {
|
|
int t[9] = {2, 9, 4, 7, 5, 3, 6, 1, 8};
|
|
printf("Unsorted : ");
|
|
print_t(t, 9);
|
|
printf("\n");
|
|
f(t, 9);
|
|
printf("Sorted : ");
|
|
print_t(t, 9);
|
|
printf("\n");
|
|
} |