Created
April 11, 2011 23:53
-
-
Save radiofreejohn/914632 to your computer and use it in GitHub Desktop.
insertion sort for my numbers structure
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include "numbers.h" | |
void insertionSort(struct numbers*); | |
int main() | |
{ | |
struct numbers myNumbers = generateRandoms(1,10); | |
int i; | |
for (i = 0; i < myNumbers.size; i++) | |
printf("%d ", myNumbers.values[i]); | |
printf("\n"); | |
insertionSort(&myNumbers); | |
for (i = 0; i < myNumbers.size; i++) | |
printf("%d ", myNumbers.values[i]); | |
printf("\n"); | |
return 0; | |
} | |
void insertionSort(struct numbers *myNumbers) | |
{ | |
int i, j, k; | |
for (i = 1; i < myNumbers->size; i++) | |
{ | |
k = myNumbers->values[i]; | |
j = i; | |
while (myNumbers->values[j-1] > k) | |
{ | |
myNumbers->values[j] = myNumbers->values[j-1]; | |
j--; | |
} | |
myNumbers->values[j] = k; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment