Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define LENGTH 5
- void insertionSort (int *vet)
- {
- int i, j, chave;
- for (j = 1; j < LENGTH; j++) {
- chave = vet[j];
- for (i = j - 1; i >= 0 && vet[i] > chave; i--) {
- vet[i + 1] = vet[i];
- }
- vet[i + 1] = chave;
- }
- }
- void print (int *vet)
- {
- int i;
- for (i = 0; i < LENGTH; i++) {
- printf("%d\n", vet[i]);
- }
- }
- int main ()
- {
- int vet[LENGTH] = {23, 18, 7, 29, 25};
- printf("-------- Before --------\n");
- print(vet);
- insertionSort(vet);
- printf("-------- After --------\n");
- print(vet);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement