KenadyDwag44

Untitled

Sep 26th, 2021 (edited)
524
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.94 KB | None | 0 0
  1. #include <iostream>
  2. #include <chrono>
  3. #include <array>
  4.  
  5. using namespace std;
  6. using namespace std::chrono;
  7.  
  8. void insertion_sort(int size, int array[])
  9. {
  10. int key;
  11. int i;
  12. int j;
  13. for (i = 1; i < size; i++)
  14. {
  15. key = array[i];
  16. j = i - 1;
  17.  
  18. while (j >= 0 && array[j] > key)
  19. {
  20. array[j + 1] = array[j];
  21. j = j - 1;
  22. }
  23. array[j + 1] = key;
  24. }
  25. }
  26.  
  27. void zero_array(int size, int array[])
  28. {
  29. for(int i = 0; i < size; i++)
  30. {
  31.  
  32. array[i] = 0;
  33. }
  34. }
  35.  
  36.  
  37. void print_array(int size, int array[])
  38. {
  39. // Standard print function
  40. for(int j = 0; j < size; j++)
  41. {
  42. std::cout << array[j] << " ";
  43. }
  44. std::cout << endl;
  45.  
  46. return;
  47. }
  48.  
  49. void sort(int array[], int size, int array_number)
  50. {
  51. cout << "---------------------------------------------------" << endl;
  52. cout << "Array " << array_number << ": " << endl;
  53. //print_array(array_size, test_array);
  54. auto start_time = high_resolution_clock::now();
  55. insertion_sort(size, array);
  56. auto stop_time = high_resolution_clock::now();
  57. auto total_time = duration_cast<nanoseconds>(stop_time - start_time);
  58. cout << " Time taken to sort: " << total_time.count() << " nanoseconds" << endl;
  59. cout << "clearing Array" << endl;
  60. zero_array(size, array);
  61. cout << "---------------------------------------------------" << endl;
  62. }
  63.  
  64. int main() {
  65.  
  66. auto array_size = 5000 ;
  67. cout << " Enter Array Size: ";
  68. cin >> array_size;
  69. int test_array[array_size];
  70. //-------------------------------------------------------------//
  71. //Case 1: All random array
  72.  
  73. for(int i = 0; i < array_size; i++)
  74. {
  75. //Generates a random integer between 0 and 99
  76.  
  77. test_array[i] = rand()%10000 + 1;
  78.  
  79. }
  80. sort(test_array, array_size, 1);
  81.  
  82. //-------------------------------------------------------------//
  83. //Case 2: Array with constant integer
  84.  
  85. for(int i = 0; i < array_size; i++)
  86. {
  87. int constant_integer = 1;
  88. test_array[i] = constant_integer;
  89. }
  90.  
  91. sort(test_array, array_size, 2);
  92. //-------------------------------------------------------------//
  93. //Case 3: Fills array sorted starting from 0 -> size
  94.  
  95.  
  96. for(int i = 0; i < array_size; i++)
  97. {
  98.  
  99. test_array[i] = i;
  100. }
  101.  
  102. sort(test_array, array_size, 3);
  103. //-------------------------------------------------------------//
  104. //Case 4: Fills array sorted starting from 0 -> size from end of array
  105. int direction_modifier = array_size - 1;
  106.  
  107. for(int i = 0; i < array_size; i++)
  108. {
  109.  
  110. test_array[direction_modifier] = i;
  111. direction_modifier--;
  112. }
  113.  
  114. sort(test_array, array_size, 4);
  115. //-------------------------------------------------------------//
  116. cout << " done " << endl;
  117.  
  118. return 0;
  119. }
Add Comment
Please, Sign In to add comment