From e3ee7ae3db3eba1664d3506b9cec5703192eeeb6 Mon Sep 17 00:00:00 2001
From: Werner <guilherme.werner@tribufu.com>
Date: Thu, 21 Sep 2023 10:27:06 -0300
Subject: [PATCH] Initial commit

---
 .editorconfig | 12 +++++++
 .gitignore    |  3 ++
 seq.c         | 87 +++++++++++++++++++++++++++++++++++++++++++++++++++
 3 files changed, 102 insertions(+)
 create mode 100644 .editorconfig
 create mode 100644 .gitignore
 create mode 100644 seq.c

diff --git a/.editorconfig b/.editorconfig
new file mode 100644
index 0000000..88df879
--- /dev/null
+++ b/.editorconfig
@@ -0,0 +1,12 @@
+root = true
+
+[*]
+end_of_line = lf
+indent_style = space
+indent_size = 4
+charset = utf-8
+trim_trailing_whitespace = true
+insert_final_newline = true
+
+[*.md]
+trim_trailing_whitespace = false
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..0d0e291
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,3 @@
+par
+seq
+*.txt
diff --git a/seq.c b/seq.c
new file mode 100644
index 0000000..2a20fd9
--- /dev/null
+++ b/seq.c
@@ -0,0 +1,87 @@
+/* C implementation QuickSort from  http://w...content-available-to-author-only...s.org/quick-sort/ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+// A utility function to swap two elements
+void swap(int *a, int *b)
+{
+    int t = *a;
+    *a = *b;
+    *b = t;
+}
+
+/* This function takes last element as pivot, places
+   the pivot element at its correct position in sorted
+    array, and places all smaller (smaller than pivot)
+   to left of pivot and all greater elements to right
+   of pivot */
+int partition(int arr[], int low, int high)
+{
+    int pivot = arr[high]; // pivot
+    int i = (low - 1);     // Index of smaller element
+
+    for (int j = low; j <= high - 1; j++)
+    {
+        // If current element is smaller than or
+        // equal to pivot
+        if (arr[j] <= pivot)
+        {
+            i++; // increment index of smaller element
+            swap(&arr[i], &arr[j]);
+        }
+    }
+
+    swap(&arr[i + 1], &arr[high]);
+
+    return (i + 1);
+}
+
+/* The main function that implements QuickSort
+ arr[] --> Array to be sorted,
+  low  --> Starting index,
+  high  --> Ending index */
+void quickSort(int arr[], int low, int high)
+{
+    if (low < high)
+    {
+        /* pi is partitioning index, arr[p] is now
+       at right place */
+        int pi = partition(arr, low, high);
+
+        // Separately sort elements before
+        // partition and after partition
+        quickSort(arr, low, pi - 1);
+        quickSort(arr, pi + 1, high);
+    }
+}
+
+/* Function to print an array */
+void printArray(int arr[], int size)
+{
+    int i;
+
+    for (i = 0; i < size; i++)
+    {
+        printf("%d ", arr[i]);
+    }
+
+    printf("\n");
+}
+
+// Driver program to test above functions
+int main()
+{
+    int i, n = 10000000;
+    int *arr = (int *)malloc(n * sizeof(int));
+
+    for (i = 0; i < n; i++)
+    {
+        arr[i] = rand() % n;
+    }
+
+    quickSort(arr, 0, n - 1);
+    // printf("Sorted array: \n");
+    // printArray(arr, n);
+    return 0;
+}