Add Odd-Even Sort

Author: Niko-the-Useless

src/SortAlgorithms.cpp

@@ -336,6 +336,36 @@ int algo::bitonicSort(std::vector<Sortable>& sortElements, int timeSleep, const
 
 	return numOfComparisons;
 }
+/**
+ * @brief Odd-Even/Brick sort
+ * @author @Niko-the-Useless
+ * @param sortElements Main array containing the elements to be sorted
+ * @param timeSleep Time to wait between iterations in miliseconds
+ * @param interrupt Bool to stop the sort process
+ * @return Number of comparisons made
+ */
+
+int algo::oddEvenSort(std::vector<Sortable>& sortElements, int timeSleep, const std::atomic<bool>& interrupt){
+	int numOfComparisons = 0;
+	
+	for(int n=1;n<=sortElements.size()-2;n=n+2){ //bubble sort for odd elements
+		if (interrupt){return numOfComparisons;}
+		if(sortElements[n].value>sortElements[n+1].value){
+			algoUtils::swap(sortElements, timeSleep, sortElements[n], sortElements[n+1]);
+		}
+		numOfComparisons++;
+	}
+	
+	for(int n=0;n<=sortElements.size()-2;n=n+2){ //bubble sort for even elements
+		if (interrupt){return numOfComparisons;}
+		if(sortElements[n].value>sortElements[n+1].value){
+			algoUtils::swap(sortElements, timeSleep, sortElements[n], sortElements[n+1]);
+		}
+		numOfComparisons++;
+	}
+
+	return numOfComparisons; 
+}
 
 //
 // ────────────────────────────────────────────────────────── II ──────────

src/SortAlgorithms.h

@@ -11,6 +11,7 @@ namespace algo {
 	int cocktailSort(std::vector<Sortable>& sortElements, int timeSleep, const std::atomic<bool>& interrupt);
 	int bogoSort(std::vector<Sortable>& sortElements, int timeSleep, const std::atomic<bool>& interrupt);
 	int bitonicSort(std::vector<Sortable>& sortElements, int timeSleep, const std::atomic<bool>& interrupt);
+	int oddEvenSort(std::vector<Sortable>& sortElements, int timeSleep, const std::atomic<bool>& interrupt);
 }
 
 namespace algoUtils {

src/SortController.cpp

@@ -121,6 +121,9 @@ void SortController::_startSort(int sortType) {
 		case 6:
 			numOfComparisons += algo::bitonicSort(_sortElements, _timeSleep, _interrupt);
 			break;
+		case 7:
+			numOfComparisons += algo::oddEvenSort(_sortElements, _timeSleep, _interrupt);
+			break;
 		default:
 			return;
 		}

src/Utils.cpp

@@ -32,6 +32,9 @@ std::string Utils::getSortType(int sortType) {
 	case 6:
 		return "Bitonic sort";
 
+	case 7:
+		return "Odd-Even sort";
+
 	default:
 		return kNoSort;
 	}