Subida de tareas

.vscode/c_cpp_properties.json

@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "windows-gcc-x64",
+      "includePath": [
+        "${workspaceFolder}/**"
+      ],
+      "compilerPath": "C:/Strawberry/c/bin/gcc.exe",
+      "cStandard": "${default}",
+      "cppStandard": "${default}",
+      "intelliSenseMode": "windows-gcc-x64",
+      "compilerArgs": [
+        ""
+      ]
+    }
+  ],
+  "version": 4
+}

.vscode/launch.json

@@ -0,0 +1,24 @@
+{
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "C/C++ Runner: Debug Session",
+      "type": "cppdbg",
+      "request": "launch",
+      "args": [],
+      "stopAtEntry": false,
+      "externalConsole": true,
+      "cwd": "c:/Users/Usuario PC/Desktop/Tareas",
+      "program": "c:/Users/Usuario PC/Desktop/Tareas/build/Debug/outDebug",
+      "MIMode": "gdb",
+      "miDebuggerPath": "gdb",
+      "setupCommands": [
+        {
+          "description": "Enable pretty-printing for gdb",
+          "text": "-enable-pretty-printing",
+          "ignoreFailures": true
+        }
+      ]
+    }
+  ]
+}

.vscode/settings.json

@@ -0,0 +1,59 @@
+{
+  "C_Cpp_Runner.cCompilerPath": "gcc",
+  "C_Cpp_Runner.cppCompilerPath": "g++",
+  "C_Cpp_Runner.debuggerPath": "gdb",
+  "C_Cpp_Runner.cStandard": "",
+  "C_Cpp_Runner.cppStandard": "",
+  "C_Cpp_Runner.msvcBatchPath": "C:/Program Files/Microsoft Visual Studio/VR_NR/Community/VC/Auxiliary/Build/vcvarsall.bat",
+  "C_Cpp_Runner.useMsvc": false,
+  "C_Cpp_Runner.warnings": [
+    "-Wall",
+    "-Wextra",
+    "-Wpedantic",
+    "-Wshadow",
+    "-Wformat=2",
+    "-Wcast-align",
+    "-Wconversion",
+    "-Wsign-conversion",
+    "-Wnull-dereference"
+  ],
+  "C_Cpp_Runner.msvcWarnings": [
+    "/W4",
+    "/permissive-",
+    "/w14242",
+    "/w14287",
+    "/w14296",
+    "/w14311",
+    "/w14826",
+    "/w44062",
+    "/w44242",
+    "/w14905",
+    "/w14906",
+    "/w14263",
+    "/w44265",
+    "/w14928"
+  ],
+  "C_Cpp_Runner.enableWarnings": true,
+  "C_Cpp_Runner.warningsAsError": false,
+  "C_Cpp_Runner.compilerArgs": [],
+  "C_Cpp_Runner.linkerArgs": [],
+  "C_Cpp_Runner.includePaths": [],
+  "C_Cpp_Runner.includeSearch": [
+    "*",
+    "**/*"
+  ],
+  "C_Cpp_Runner.excludeSearch": [
+    "**/build",
+    "**/build/**",
+    "**/.*",
+    "**/.*/**",
+    "**/.vscode",
+    "**/.vscode/**"
+  ],
+  "C_Cpp_Runner.useAddressSanitizer": false,
+  "C_Cpp_Runner.useUndefinedSanitizer": false,
+  "C_Cpp_Runner.useLeakSanitizer": false,
+  "C_Cpp_Runner.showCompilationTime": false,
+  "C_Cpp_Runner.useLinkTimeOptimization": false,
+  "C_Cpp_Runner.msvcSecureNoWarnings": false
+}

.vscode/tasks.json

@@ -0,0 +1,28 @@
+{
+    "tasks": [
+        {
+            "type": "cppbuild",
+            "label": "C/C++: g++.exe compilar archivo activo",
+            "command": "C:\\Strawberry\\c\\bin\\g++.exe",
+            "args": [
+                "-fdiagnostics-color=always",
+                "-g",
+                "${file}",
+                "-o",
+                "${fileDirname}\\${fileBasenameNoExtension}.exe"
+            ],
+            "options": {
+                "cwd": "${fileDirname}"
+            },
+            "problemMatcher": [
+                "$gcc"
+            ],
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            },
+            "detail": "Tarea generada por el depurador."
+        }
+    ],
+    "version": "2.0.0"
+}

Algoritmos_de_Ordenamiento/Burbuja.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+void bubbleSort(std::vector<int> &lista, int n)
+{
+    for (int i = 0; i <= n - 2; ++i)
+    {
+        bool intercambiado = false;
+
+        for (int j = 0; j <= n - 2 - i; ++j)
+        {
+            if (lista[j] > lista[j + 1])
+            {
+                std::swap(lista[j], lista[j + 1]);
+                intercambiado = true;
+            }
+        }
+
+        if (!intercambiado)
+        {
+            break;
+        }
+    }
+}

Algoritmos_de_Ordenamiento/mergesort.cpp

@@ -0,0 +1,84 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+void mezclar(vector<int> &lista, int inicio, int medio, int fin)
+{
+    int n1 = medio - inicio + 1;
+    int n2 = fin - medio;
+
+    vector<int> izq(n1), der(n2);
+
+    for (int i = 0; i < n1; i++)
+        izq[i] = lista[inicio + i];
+    for (int j = 0; j < n2; j++)
+        der[j] = lista[medio + 1 + j];
+
+    int i = 0, j = 0, k = inicio;
+
+    while (i < n1 && j < n2)
+    {
+        if (izq[i] <= der[j])
+        {
+            lista[k] = izq[i];
+            i++;
+        }
+        else
+        {
+            lista[k] = der[j];
+            j++;
+        }
+        k++;
+    }
+
+    while (i < n1)
+    {
+        lista[k] = izq[i];
+        i++;
+        k++;
+    }
+    while (j < n2)
+    {
+        lista[k] = der[j];
+        j++;
+        k++;
+    }
+}
+
+void mergeSort(vector<int> &lista, int inicio, int fin)
+{
+    if (inicio >= fin)
+        return;
+
+    int medio = inicio + (fin - inicio) / 2; // (Paso 5)
+
+    mergeSort(lista, inicio, medio);
+    mergeSort(lista, medio + 1, fin);
+
+    mezclar(lista, inicio, medio, fin);
+}
+
+int main()
+{
+    int n, temp;
+    vector<int> datos;
+
+    while (cin >> temp)
+    {
+        datos.push_back(temp);
+    }
+
+    if (!datos.empty())
+    {
+        mergeSort(datos, 0, datos.size() - 1);
+
+        for (size_t i = 0; i < datos.size(); i++)
+        {
+            cout << datos[i] << (i == datos.size() - 1 ? "" : " ");
+        }
+        cout << endl;
+    }
+
+    return 0;
+}

Algoritmos_de_Ordenamiento/seleccion.cpp

@@ -0,0 +1,49 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+void selectionSort(vector<int> &lista, int n)
+{
+    for (int i = 0; i <= n - 2; ++i)
+    {
+        int min_idx = i;
+
+        for (int j = i + 1; j <= n - 1; ++j)
+        {
+            if (lista[j] < lista[min_idx])
+            {
+                min_idx = j;
+            }
+        }
+
+        if (min_idx != i)
+        {
+            swap(lista[i], lista[min_idx]);
+        }
+    }
+}
+
+int main()
+{
+    int n;
+    if (!(cin >> n))
+        return 0;
+
+    vector<int> lista(n);
+    for (int i = 0; i < n; ++i)
+    {
+        cin >> lista[i];
+    }
+
+    selectionSort(lista, n);
+
+    for (int i = 0; i < n; ++i)
+    {
+        cout << lista[i] << (i == n - 1 ? "" : " ");
+    }
+    cout << endl;
+
+    return 0;
+}