MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / main

Function main

CPP/sorting/randomised_quicksort.cpp:53–75  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

51}
52
53int main() {
54 int size;
55 cout << "Enter size of array: ";
56 cin >> size;
57 int arr[size];
58 cout << "Enter contents of array:\n";
59 for (int i = 0; i < size; i++)
60 cin >> arr[i];
61
62 cout << "\nUnsorted array:\n[ ";
63 for (int i = 0; i < size; i++)
64 cout << arr[i] << " ";
65 cout << "]\n";
66
67 quickSort(arr, 0, size - 1);
68
69 cout << "Sorted array:\n[ ";
70 for (int i = 0; i < size; i++)
71 cout << arr[i] << " ";
72 cout << "]\n";
73
74 return 0;
75}

Callers

nothing calls this directly

Calls 1

quickSortFunction · 0.70

Tested by

no test coverage detected