Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <chrono>
- #include <array>
- using namespace std;
- using namespace std::chrono;
- void insertion_sort(int size, int array[])
- {
- int key;
- int i;
- int j;
- for (i = 1; i < size; i++)
- {
- key = array[i];
- j = i - 1;
- while (j >= 0 && array[j] > key)
- {
- array[j + 1] = array[j];
- j = j - 1;
- }
- array[j + 1] = key;
- }
- }
- void zero_array(int size, int array[])
- {
- for(int i = 0; i < size; i++)
- {
- array[i] = 0;
- }
- }
- void print_array(int size, int array[])
- {
- // Standard print function
- for(int j = 0; j < size; j++)
- {
- std::cout << array[j] << " ";
- }
- std::cout << endl;
- return;
- }
- void sort(int array[], int size, int array_number)
- {
- cout << "---------------------------------------------------" << endl;
- cout << "Array " << array_number << ": " << endl;
- //print_array(array_size, test_array);
- auto start_time = high_resolution_clock::now();
- insertion_sort(size, array);
- auto stop_time = high_resolution_clock::now();
- auto total_time = duration_cast<nanoseconds>(stop_time - start_time);
- cout << " Time taken to sort: " << total_time.count() << " nanoseconds" << endl;
- cout << "clearing Array" << endl;
- zero_array(size, array);
- cout << "---------------------------------------------------" << endl;
- }
- int main() {
- auto array_size = 5000 ;
- cout << " Enter Array Size: ";
- cin >> array_size;
- int test_array[array_size];
- //-------------------------------------------------------------//
- //Case 1: All random array
- for(int i = 0; i < array_size; i++)
- {
- //Generates a random integer between 0 and 99
- test_array[i] = rand()%10000 + 1;
- }
- sort(test_array, array_size, 1);
- //-------------------------------------------------------------//
- //Case 2: Array with constant integer
- for(int i = 0; i < array_size; i++)
- {
- int constant_integer = 1;
- test_array[i] = constant_integer;
- }
- sort(test_array, array_size, 2);
- //-------------------------------------------------------------//
- //Case 3: Fills array sorted starting from 0 -> size
- for(int i = 0; i < array_size; i++)
- {
- test_array[i] = i;
- }
- sort(test_array, array_size, 3);
- //-------------------------------------------------------------//
- //Case 4: Fills array sorted starting from 0 -> size from end of array
- int direction_modifier = array_size - 1;
- for(int i = 0; i < array_size; i++)
- {
- test_array[direction_modifier] = i;
- direction_modifier--;
- }
- sort(test_array, array_size, 4);
- //-------------------------------------------------------------//
- cout << " done " << endl;
- return 0;
- }
Add Comment
Please, Sign In to add comment