66 lines
1.4 KiB
C
66 lines
1.4 KiB
C
#include<stdio.h>
|
|
#include<stdlib.h>
|
|
#include<string.h>
|
|
|
|
int* sort(int*, int);
|
|
void swap(int*, int, int);
|
|
int DEBUG;
|
|
|
|
int main(){
|
|
|
|
char* _debug = getenv("DEBUG");
|
|
if(_debug)
|
|
DEBUG = !strcmp(_debug,"1");
|
|
//how does this even work???
|
|
|
|
int arr[] = {1,2,3,5,4};
|
|
int arr_len = sizeof(arr) / sizeof(arr[0]);
|
|
sort(arr, arr_len);
|
|
printf("\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
int* sort(int* arr, int length){
|
|
|
|
if(DEBUG){
|
|
printf("length of array to be sorted: %d\n", length);
|
|
printf("elements of array to be sorted: ");
|
|
for(int i=0; i<length; i++){
|
|
if(i!=0) printf(", ");
|
|
printf("%d", arr[i]);
|
|
}
|
|
printf("\n");
|
|
}
|
|
|
|
int changes = 0;
|
|
do {
|
|
changes = 0;
|
|
for(int i=0; i<length-1; i++){
|
|
if(arr[i]>arr[i+1]){
|
|
if(DEBUG)printf("need to swap [%d]->%d and [%d]->%d\n",i,arr[i],i+1,arr[i+1]);
|
|
swap(arr, i, i+1);
|
|
++changes;
|
|
}
|
|
}
|
|
} while (changes != 0);
|
|
|
|
if(DEBUG){
|
|
printf("=====\nelement post-sort are: ");
|
|
for(int i=0; i<length; i++){
|
|
if(i!=0) printf(", ");
|
|
printf("%d", arr[i]);
|
|
}
|
|
}
|
|
|
|
return arr;
|
|
}
|
|
void swap(int* arr, int left, int right){
|
|
if(DEBUG)
|
|
printf("PRESWAP left[%d] is: %d; right[%d] is %d\n", left,arr[left],right,arr[right]);
|
|
int _hold = arr[left];
|
|
arr[left] = arr[right];
|
|
arr[right] = _hold;
|
|
if(DEBUG)
|
|
printf("POSTSWAP left[%d] is: %d; right[%d] is %d\n", left,arr[left],right,arr[right]);
|
|
}
|