Advertisement
Guest User

Untitled

a guest
Oct 16th, 2019
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.56 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. #define LENGTH 5
  4.  
  5. void insertionSort (int *vet)
  6. {
  7. int i, j, chave;
  8. for (j = 1; j < LENGTH; j++) {
  9. chave = vet[j];
  10. for (i = j - 1; i >= 0 && vet[i] > chave; i--) {
  11. vet[i + 1] = vet[i];
  12. }
  13.  
  14. vet[i + 1] = chave;
  15. }
  16. }
  17.  
  18. void print (int *vet)
  19. {
  20. int i;
  21. for (i = 0; i < LENGTH; i++) {
  22. printf("%d\n", vet[i]);
  23. }
  24. }
  25.  
  26. int main ()
  27. {
  28. int vet[LENGTH] = {23, 18, 7, 29, 25};
  29.  
  30. printf("-------- Before --------\n");
  31. print(vet);
  32.  
  33. insertionSort(vet);
  34.  
  35. printf("-------- After --------\n");
  36. print(vet);
  37.  
  38. return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement