From 943f2ecbadc3d8407bf65c3e7ab4527e8f80a89a Mon Sep 17 00:00:00 2001
From: Tyler Perkins <tperki17@kent.edu>
Date: Tue, 5 Apr 2022 13:30:01 -0400
Subject: [PATCH] Update for 05-04-22 13:30

---
 tech/quicksort.wiki | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/tech/quicksort.wiki b/tech/quicksort.wiki
index 8076e06..deb6af1 100644
--- a/tech/quicksort.wiki
+++ b/tech/quicksort.wiki
@@ -5,4 +5,4 @@ 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.
+this pivot, `pvt` is chosen.