C/sorting/comb_sort.c at master · SelfCodeLearning/C · GitHub

History

48 lines (45 loc) · 937 Bytes

Raw

#include <stdio.h>

#include <stdlib.h>

#define SHRINK 1.3 //suggested shrink factor value

void sort (int *numbers, int size)

{

int gap = size;

while (gap > 1) //gap = 1 means that the array is sorted

{

gap = gap/SHRINK;

int i = 0;

while ((i + gap) < size)

{ //similiar to the Shell Sort

if (numbers[i] > numbers[i + gap])

{

int tmp = numbers[i];

numbers[i] = numbers[i + gap];

numbers[i + gap] = tmp;

}

i++;

}

void display(int *array, int n)

{

int i;

for (i = 0; i < n; ++i)

printf("%d ", array[i]);

printf("\n");

}

int main()

{

int size = 6;

int *numbers = malloc(size*sizeof(int));

printf("Insert %d unsorted numbers: \n", size);

int i;

for (i = 0; i < size; ++i)

scanf("%d", &numbers[i]);

printf("Initial array: ");

display(numbers, size);

sort(numbers, size);

printf("Sorted array: ");

display(numbers, size);

free(numbers);

return 0;

}

C/sorting/comb_sort.c at master · SelfCodeLearning/C · GitHub

Uh oh!

Expand file tree

Breadcrumbs

comb_sort.c

Latest commit

History

Breadcrumbs

comb_sort.c

File metadata and controls