<init> first commit

Author: jjordanoc

Diff for: .gitignore

@@ -0,0 +1,2 @@
+cmake-build-debug
+inputs

Diff for: .idea/.gitignore

@@ -0,0 +1,10 @@
+cmake_minimum_required(VERSION 3.22)
+project(ordenamiento)
+
+set(CMAKE_CXX_STANDARD 17)
+
+add_executable(ordenamiento main.cpp)
+
+add_executable(generate generate.cpp counting_sort.h)
+
+add_executable(test test.cpp counting_sort.h)

Diff for: .idea/inspectionProfiles/Project_Default.xml

@@ -0,0 +1,42 @@
+#ifndef ORDENAMIENTO_COUNTING_SORT_H
+#define ORDENAMIENTO_COUNTING_SORT_H
+
+#include <iostream>
+#include <fstream>
+#include <ctime>
+#include <cmath>
+#include <chrono>
+
+// enteros de 0 a k
+void counting_sort(int *a, int size) {
+    int k = 0;
+    // 1. encontrar el maximo elemento
+    for (int i = 0; i < size; ++i) {
+        k = std::max(a[i], k);
+    }
+    k++;
+    // 2. crear arreglo auxiliar
+    int *c = new int[k];
+    for (int i = 0; i < k; ++i) {
+        c[i] = 0;
+    }
+    // 3. contar apariciones de cada elemento
+    for (int i = 0; i < size; ++i) {
+        c[a[i]]++;
+    }
+    // 4. acumular cuenta
+    for (int i = 1; i < k; ++i) {
+        c[i] = c[i] + c[i-1];
+    }
+    // 5. crear nuevo arreglo
+    int *b = new int[size];
+    for (int i = size - 1; i >= 0; --i) {
+        b[c[a[i]] - 1] = a[i];
+        c[a[i]]--;
+    }
+    std::copy(b, b + size, a);
+    delete[] b;
+    delete[] c;
+}
+
+#endif //ORDENAMIENTO_COUNTING_SORT_H

Diff for: .idea/misc.xml

@@ -0,0 +1,30 @@
+#include <iostream>
+#include <fstream>
+#include <ctime>
+#include <cmath>
+#include <chrono>
+
+
+void generate_input_files(int n) {
+    srand(time(NULL));
+    std::ofstream outfile("../inputs/" + std::to_string(n) + ".in");
+    for (int i = 0; i < n; ++i) {
+        outfile << rand() % n << "\n";
+    }
+    outfile.close();
+}
+
+void generate_files() {
+    for (int i = 10; i <= pow(10, 7); i *= 10) {
+        generate_input_files(i);
+    }
+}
+
+int main() {
+    auto start = std::chrono::high_resolution_clock::now();
+    generate_files();
+    auto end = std::chrono::high_resolution_clock::now();
+    double duration = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count();
+    std::cout << "Ejecucion exitosa en " << duration * 1e-9 << " s" << std::endl;
+    return 0;
+}

Diff for: .idea/modules.xml

@@ -0,0 +1,25 @@
+#include <iostream>
+
+#include "counting_sort.h"
+
+template<int size>
+void print_array(int (&a)[size]) {
+    for (int i = 0; i < size; ++i) {
+        std::cout << a[i] << " ";
+    }
+    std::cout << "\n";
+}
+
+int main() {
+    // ejemplo 1
+    int a1[] = {18, 17, 6, 2, 18, 6, 14};
+    print_array(a1);
+    counting_sort(a1, 7);
+    print_array(a1);
+    // ejemplo 2
+    int a2[] = {39, 34, 11, 17, 42, 40, 44, 31, 19};
+    print_array(a2);
+    counting_sort(a2, 9);
+    print_array(a2);
+}
+

Diff for: .idea/ordenamiento.iml

@@ -0,0 +1,8 @@
+n,duration(ns)
+10,1300
+100,2400
+1000,17700
+10000,202300
+100000,1.4043e+006
+1000000,1.11738e+007
+10000000,1.46628e+008

Diff for: CMakeLists.txt

@@ -0,0 +1,31 @@
+#include "counting_sort.h"
+#include <fstream>
+
+void run_test(int n, std::ofstream &results) {
+    std::ifstream infile("../inputs/" + std::to_string(n) + ".in");
+    if (!infile.is_open()) {
+        std::cout << "Error." << std::endl;
+        return;
+    }
+    std::string buf;
+    int *a = new int[n];
+    int i = 0;
+    while (std::getline(infile, buf)) {
+        a[i] = std::stoi(buf);
+        ++i;
+    }
+    auto start = std::chrono::steady_clock::now();
+    counting_sort(a, n);
+    auto end = std::chrono::steady_clock::now();
+    double duration = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count();
+    results << n << "," << duration << "\n";
+    delete[] a;
+}
+
+int main() {
+    std::ofstream results("../results.csv");
+    results << "n,duration(ns)" << "\n";
+    for (int i = 10; i <= pow(10, 7); i *= 10) {
+        run_test(i, results);
+    }
+}