From c577c1372212c12a192ef97dce2197525a011884 Mon Sep 17 00:00:00 2001
From: ajax7876 <69567574+ajax7876@users.noreply.github.com>
Date: Fri, 1 Oct 2021 22:04:32 +0530
Subject: [PATCH] Update bubble_sort.h

---
 include/bubble_sort.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/include/bubble_sort.h b/include/bubble_sort.h
index ca194ced..1a99a54b 100644
--- a/include/bubble_sort.h
+++ b/include/bubble_sort.h
@@ -11,7 +11,7 @@
  * sorting algorithm that works by repeatedly stepping through the list to be 
  * sorted, comparing each pair of adjacent items and swapping them if they are 
  * in the wrong order. The pass through the list is repeated until no swaps are
- * needed, which indicates that the list is sorted. The algorithm gets its name
+ * required, which indicates that the list is sorted. The algorithm gets its name
  * from the way smaller elements "bubble" to the top of the list. Because it 
  * only uses comparisons to operate on elements, it is a comparison sort. 
  * Although the algorithm is simple, most of the other sorting algorithms are