From ce20684d93f0f19af2f934c3bb49dfc7298ceae0 Mon Sep 17 00:00:00 2001
From: Tyler Perkins <tperki17@kent.edu>
Date: Mon, 4 Apr 2022 16:00:01 -0400
Subject: [PATCH] Update for 04-04-22 16:00

---
 tech/quicksort.wiki | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/tech/quicksort.wiki b/tech/quicksort.wiki
index faf1604..8076e06 100644
--- a/tech/quicksort.wiki
+++ b/tech/quicksort.wiki
@@ -3,3 +3,6 @@
 Quicksort is a sorting algorithm that runs in `O(n log n)` time.
 
 == Algorithm ==
+
+For some array `arr`, chose come pivot value in `arr`. It does not matter how
+this pivot, `pvt` is chosen.