fork download
  1.  
  2. #include <math.h>
  3. #include <stdio.h>
  4.  
  5. void insertionSort(int arr[], int n)
  6. {
  7. int i, key, j;
  8. for (i = 1; i < n; i++) {
  9. key = arr[i];
  10. j = i - 1;
  11.  
  12.  
  13. while (j >= 0 && arr[j] > key) {
  14. arr[j + 1] = arr[j];
  15. j = j - 1;
  16. }
  17. arr[j + 1] = key;
  18. }
  19. }
  20.  
  21. void printArray(int arr[], int n)
  22. {
  23. int i;
  24. for (i = 0; i < n; i++)
  25. printf("%d ", arr[i]);
  26. printf("\n");
  27. }
  28.  
  29.  
  30. int main()
  31. {
  32. int arr[] = { 12, 11, 13, 5, 6 };
  33. int n = sizeof(arr) / sizeof(arr[0]);
  34.  
  35. insertionSort(arr, n);
  36. printArray(arr, n);
  37.  
  38. return 0;
  39. }
  40.  
  41.  
  42.  
Success #stdin #stdout 0s 5424KB
stdin
45
stdout
5 6 11 12 13