From 297897941d9ec42303fb2f8a6bb3c8a7ef3e5dad Mon Sep 17 00:00:00 2001
From: ev-john <56849582+ev-john@users.noreply.github.com>
Date: Tue, 22 Oct 2019 00:04:36 +0100
Subject: [PATCH] Fix grammar mistakes

See issue #450
---
 Sorting/Heap Sort/Readme.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Sorting/Heap Sort/Readme.md b/Sorting/Heap Sort/Readme.md
index c2f0a9c9..d9061b42 100644
--- a/Sorting/Heap Sort/Readme.md	
+++ b/Sorting/Heap Sort/Readme.md	
@@ -1,3 +1,3 @@
 # Heap Sort
-Heap sort is a selection based algorithm. It has an ideia similar to Selection Sort. However, instead o search the element in a list (or array), the Heap Sort search the elements in a balanced tree computed as a Heap.
+Heap sort is a selection based algorithm. It has an idea similar to Selection Sort. However, instead of searching for the element in a list (or array), in Heap Sort you search the elements in a balanced tree computed as a Heap.
 The time complexiy of Heap Sort is allways O(nlogn).