From f0b0dc2127284019e6968c48495a5a9420f134a6 Mon Sep 17 00:00:00 2001
From: Connor McManigal <99215808+connormcmanigal@users.noreply.github.com>
Date: Wed, 29 May 2024 17:53:35 -0700
Subject: [PATCH] Update README.md

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

diff --git a/README.md b/README.md
index 1e23a98..8c40486 100644
--- a/README.md
+++ b/README.md
@@ -2,7 +2,7 @@
 
 ## Connor McManigal and Peyton Politewicz 
 
-- Implemented MergeSort, QuickSort, InsertionSort, ShellSort, BucketSort, RadixSort,
+- Implemented MergeSort, QuickSort, InsertionSort, ShellSort, BucketSort, and RadixSort
 - Created BinaryInsertionSort in an effort to improve InsertionSort runtimes and Simple Tim Sort to improve MergeSort runtimes
 - Compared time complexity of each on truly random generated arrays and almost sorted generated arrays at sizes 1000, 2000, 4000, 8000, and 16000
 - Evaluated and compared empirical and theoretical big-O as datasets scaled in size