<feat> extended original counting sort to work with all integers

Author: jjordanoc

CMakeLists.txt

@@ -12,3 +12,5 @@ add_executable(test_counting_sort test_counting_sort.cpp counting_sort.h test.h)
 add_executable(test_selection_sort.cpp test_selection_sort.cpp selection_sort.h test.h)
 
 add_executable(test_intro_sort.cpp test_intro_sort.cpp intro_sort.h test.h)
+
+add_executable(test_counting_sort_extended test_counting_sort_extended.cpp counting_sort.h test.h)

analisis/.RData

@@ -385,3 +385,14 @@ plot(log10(S$n), log10(S$`duration(ns)`), col="red", main="Tiempo de ejecución
 points(log10(C$n), log10(C$`duration(ns)`), col="green", pch=20, type = "b")
 points(log10(I$n), log10(I$`duration(ns)`), col="blue", pch=20, type="b")
 legend("topleft", col=c("red", "blue", "green"), legend=c("Selection sort", "Intro sort", "Counting sort"), lty=1)
+library(readr)
+library(ggplot2)
+C <- read_csv("counting_sort.csv")
+I <- read_csv("intro_sort.csv")
+S <- read_csv("selection_sort.csv")
+CE <- read_csv("counting_sort_extended.csv")
+plot(log10(S$n), log10(S$`duration(ns)`), col="red", main="Tiempo de ejecución vs. tamaño de entrada (escala logarítmica)", xlab="log(n)", ylab="log(Tiempo de ejecución (ns))", pch=20, type="b")
+points(log10(C$n), log10(C$`duration(ns)`), col="green", pch=20, type = "b")
+points(log10(CE$n), log10(CE$`duration(ns)`), col="pink", pch=20, type = "b")
+points(log10(I$n), log10(I$`duration(ns)`), col="blue", pch=20, type="b")
+legend("topleft", col=c("red", "blue", "green", "pink"), legend=c("Selection sort", "Intro sort", "Counting sort", "Counting sort extended"), lty=1)

analisis/.Rhistory

@@ -13,12 +13,14 @@ library(ggplot2)
 C <- read_csv("counting_sort.csv")
 I <- read_csv("intro_sort.csv")
 S <- read_csv("selection_sort.csv")
+CE <- read_csv("counting_sort_extended.csv")
 ```
 ```{r}
 plot(log10(S$n), log10(S$`duration(ns)`), col="red", main="Tiempo de ejecución vs. tamaño de entrada (escala logarítmica)", xlab="log(n)", ylab="log(Tiempo de ejecución (ns))", pch=20, type="b")
 points(log10(C$n), log10(C$`duration(ns)`), col="green", pch=20, type = "b")
+points(log10(CE$n), log10(CE$`duration(ns)`), col="pink", pch=20, type = "b")
 points(log10(I$n), log10(I$`duration(ns)`), col="blue", pch=20, type="b")
-legend("topleft", col=c("red", "blue", "green"), legend=c("Selection sort", "Intro sort", "Counting sort"), lty=1)
+legend("topleft", col=c("red", "blue", "green", "pink"), legend=c("Selection sort", "Intro sort", "Counting sort", "Counting sort extended"), lty=1)
 ```
 
 

analisis/analisis.Rmd

@@ -35,4 +35,24 @@ void counting_sort(int *a, int size) {
     delete[] c;
 }
 
+
+// enteros de nk a k (todos los enteros en un rango finito)
+void counting_sort_extended(int *a, int size) {
+    // 1. encontrar el elemento minimo
+    int nk = a[0];
+    for (int i = 0; i < size; ++i) {
+        nk = std::min(nk, a[i]);
+    }
+    // 2. quitar a cada elemento el minimo
+    for (int i = 0; i < size; ++i) {
+        a[i] = a[i] - nk;
+    }
+    // 3. utilizar counting sort normal
+    counting_sort(a, size);
+    // 4. sumar el minimo a cada elemento
+    for (int i = 0; i < size; ++i) {
+        a[i] = a[i] + nk;
+    }
+}
+
 #endif //ORDENAMIENTO_COUNTING_SORT_H

analisis/analisis.nb.html

@@ -23,4 +23,9 @@ int main() {
     print_array(a2);
     counting_sort(a2, 9);
     print_array(a2);
+    // ejemplo 3
+    int a3[] = {-39, 34, 42, 40, -44, 44, 31, 19, -3, -1, -7, 0, 0, -1, -40};
+    print_array(a3);
+    counting_sort_extended(a3, 15);
+    print_array(a3);
 }