From f2b423db58ca187415b9a47b1f49140abae76636 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Mon, 7 Aug 2023 23:01:42 -0700
Subject: [PATCH] Update README.md

---
 searching/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/searching/README.md b/searching/README.md
index 43411c3..cce5a68 100644
--- a/searching/README.md
+++ b/searching/README.md
@@ -7,7 +7,7 @@
 * binary searching is composed of 3 sections:
     * **pre-processing**: sort if collection is unsorted
     * **binary search**: using a loop or recursion to divide search space in half after each comparison (`O(log(N)`)
-    * **post-processing`: determine viable candidates in the remaining space
+    * **post-processing**: determine viable candidates in the remaining space
 
 * there are 3 "templates" when writing a binary search:
     * `while left < right`, with `left = mid + 1` and `right = mid - 1`