From ceb4680f16924148ad455f08067715171cb87512 Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Sun, 1 Oct 2023 04:41:57 +0000
Subject: [PATCH 1/3] updating DIRECTORY.md

---
 DIRECTORY.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/DIRECTORY.md b/DIRECTORY.md
index 001da2c15b99..3ec7a149b990 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -1142,7 +1142,6 @@
   * [Quick Sort 3 Partition](sorts/quick_sort_3_partition.py)
   * [Radix Sort](sorts/radix_sort.py)
   * [Random Normal Distribution Quicksort](sorts/random_normal_distribution_quicksort.py)
-  * [Random Pivot Quick Sort](sorts/random_pivot_quick_sort.py)
   * [Recursive Bubble Sort](sorts/recursive_bubble_sort.py)
   * [Recursive Insertion Sort](sorts/recursive_insertion_sort.py)
   * [Recursive Mergesort Array](sorts/recursive_mergesort_array.py)

From 505260ca62285f1d4b5ce752975c5b1d59e45124 Mon Sep 17 00:00:00 2001
From: Tianyi Zheng <tianyizheng02@gmail.com>
Date: Sun, 1 Oct 2023 01:06:21 -0400
Subject: [PATCH 2/3] Delete sorts/random_normal_distribution_quicksort.py

Deleting this file because it's a duplicate of quick_sort.py. Both files implement quick sort with a random pivot, and the only difference with this implementation is that the array elements themselves are normally distributed.
---
 sorts/random_normal_distribution_quicksort.py | 62 -------------------
 1 file changed, 62 deletions(-)
 delete mode 100644 sorts/random_normal_distribution_quicksort.py

diff --git a/sorts/random_normal_distribution_quicksort.py b/sorts/random_normal_distribution_quicksort.py
deleted file mode 100644
index f7f60903c546..000000000000
--- a/sorts/random_normal_distribution_quicksort.py
+++ /dev/null
@@ -1,62 +0,0 @@
-from random import randint
-from tempfile import TemporaryFile
-
-import numpy as np
-
-
-def _in_place_quick_sort(a, start, end):
-    count = 0
-    if start < end:
-        pivot = randint(start, end)
-        temp = a[end]
-        a[end] = a[pivot]
-        a[pivot] = temp
-
-        p, count = _in_place_partition(a, start, end)
-        count += _in_place_quick_sort(a, start, p - 1)
-        count += _in_place_quick_sort(a, p + 1, end)
-    return count
-
-
-def _in_place_partition(a, start, end):
-    count = 0
-    pivot = randint(start, end)
-    temp = a[end]
-    a[end] = a[pivot]
-    a[pivot] = temp
-    new_pivot_index = start - 1
-    for index in range(start, end):
-        count += 1
-        if a[index] < a[end]:  # check if current val is less than pivot value
-            new_pivot_index = new_pivot_index + 1
-            temp = a[new_pivot_index]
-            a[new_pivot_index] = a[index]
-            a[index] = temp
-
-    temp = a[new_pivot_index + 1]
-    a[new_pivot_index + 1] = a[end]
-    a[end] = temp
-    return new_pivot_index + 1, count
-
-
-outfile = TemporaryFile()
-p = 100  # 1000 elements are to be sorted
-
-
-mu, sigma = 0, 1  # mean and standard deviation
-X = np.random.normal(mu, sigma, p)
-np.save(outfile, X)
-print("The array is")
-print(X)
-
-
-outfile.seek(0)  # using the same array
-M = np.load(outfile)
-r = len(M) - 1
-z = _in_place_quick_sort(M, 0, r)
-
-print(
-    "No of Comparisons for 100 elements selected from a standard normal distribution"
-    "is :"
-)
-print(z)

From 1041435de2b897e0d95c1ca5e70fd6761665ec6d Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Sun, 1 Oct 2023 05:06:34 +0000
Subject: [PATCH 3/3] updating DIRECTORY.md

---
 DIRECTORY.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/DIRECTORY.md b/DIRECTORY.md
index 3ec7a149b990..07ba27790a42 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -1141,7 +1141,6 @@
   * [Quick Sort](sorts/quick_sort.py)
   * [Quick Sort 3 Partition](sorts/quick_sort_3_partition.py)
   * [Radix Sort](sorts/radix_sort.py)
-  * [Random Normal Distribution Quicksort](sorts/random_normal_distribution_quicksort.py)
   * [Recursive Bubble Sort](sorts/recursive_bubble_sort.py)
   * [Recursive Insertion Sort](sorts/recursive_insertion_sort.py)
   * [Recursive Mergesort Array](sorts/recursive_mergesort_array.py)