#include #include #include #include #include using namespace std; using namespace std::chrono; /*This was made for me to understand each sorting algorithms particular advantages and weaknesses; You can change the value of (n) in protected members and see the difference//while bigger you can see better the eficiency difference between each sort algortihm; I am thinking about implement a time execution counter for each sort//[done] Hope my English isn't wrong Dont Forget to Upvote <=> thanks 4/5/24 -> As @morpheus recomended me I add a small analisis at the end determing the fastest and slowest algorithm in terms of percentage */ class Sort { public: //Constructor randomly creates a reference array and prints it Sort() { for (int i = 0; i < n; i++) { lista[i] = rand() % 50; } cout<<"Lista Random:\n"; for (int i = 0; i < n; i++) { cout< listaB[i + 1]) { temp = listaB[i]; listaB[i] = listaB[i + 1]; listaB[i + 1] = temp; sort = true; swaps+=1; } } } while (sort); PublicListB(method); } //Selection Sort public: void SelectionSort() { method ="Selection Sort Method"; setListB(); int temp; for(int i=0;ilistaB[j]) { temp = listaB[i]; listaB[i] = listaB[j]; listaB[j] = temp; swaps+=1; } } } PublicListB (method); } //Insertion Sort void InsertionSort() { setListB(); method = "Insertion Sort Method"; int temp = 0; int j; for (int i = 1; i < n; i++) { j = i; while(j>0 && listaB[j] < listaB[j-1]) { temp = listaB[j]; listaB[j] = listaB[j-1]; listaB[j-1] = temp; j--; swaps+=1; } } PublicListB (method); } //Merge Sort Methods: //Merging two halfs void Merge(int *lista, int from, int to, int mid) { int i = from; int j = mid + 1; int k = 0; int *temp = new int[to-from+1]; while (i <= mid && j <= to) { if (lista[i] < lista[j]) { temp[k] = lista[i]; k++; i++; } else { temp[k] = lista[j]; k++; j++; } } while (i <= mid) { temp[k] = lista[i]; k++; i++; } while (j <= to) { temp[k] = lista[j]; k++; j++; } for (i = from; i <= to; i++) { lista[i] = temp[i-from]; } delete[] temp; } //dividing array in halfs void MergeSortedList(int *lista, int from, int to) { int mid; if (from < to) { mid=(from+to)/2; MergeSortedList (lista, from, mid); MergeSortedList (lista, mid+1, to); Merge(lista, from, to, mid); } } //starting merge sort void MergeSort() { setListB(); MergeSortedList(listaB, 0, n-1); } // quick sorting with pivot randomly selected void QuickSorting (int *lista ,int left,int right){ int temp = 0; int l = left; int r = right - 1; int size = right - left; if (size > 1) { int pivot=lista[(right + left)/2]; while (l < r) { while(lista[r]>pivot && r>l) { r--; } while(lista[l] duration = end - start; cout << fixed; cout << "Execution Time: " << duration.count() << " secs\n\n"; duration_secs += duration.count(); if (duration.count() < fastest) { fastest = duration.count(); fast_sort = method; } if (duration.count() > slowest) { slowest = duration.count(); slow_sort = method; } } //setting average duration of all sorts and printing it void set_print_Average() { average = duration_secs / 5; cout << "Average duration: " << fixed << average <<" secs" << endl< " < " <

Sort Algorithms (Comparacion de eficiencia)