From 510cb897aa9bdec395cb3db3767ff6cbcc70a93e Mon Sep 17 00:00:00 2001
From: rajsukanya <34818638+rajsukanya@users.noreply.github.com>
Date: Thu, 31 Oct 2019 12:44:31 -0400
Subject: [PATCH 1/2] Update Readme.md

---
 Sorting/Heap Sort/Readme.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Sorting/Heap Sort/Readme.md b/Sorting/Heap Sort/Readme.md
index c2f0a9c9..3e8c7eba 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.
-The time complexiy of Heap Sort is allways O(nlogn).
+# Heapsort
+Heapsort is a comparison-based algorithm that uses the heap data structure (a binary heap). It is similar to selection sort. However, instead of searching for the element in a list (or an array), heapsort searches for the element in a complete binary tree.
+The time complexity of heapsort is always O(nlogn).

From 05cac5f34e5bae6e82351fa701cf02a302f902d0 Mon Sep 17 00:00:00 2001
From: rajsukanya <34818638+rajsukanya@users.noreply.github.com>
Date: Thu, 31 Oct 2019 12:44:58 -0400
Subject: [PATCH 2/2] Update Readme.md

---
 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 3e8c7eba..b65334a0 100644
--- a/Sorting/Heap Sort/Readme.md	
+++ b/Sorting/Heap Sort/Readme.md	
@@ -1,3 +1,3 @@
 # Heapsort
-Heapsort is a comparison-based algorithm that uses the heap data structure (a binary heap). It is similar to selection sort. However, instead of searching for the element in a list (or an array), heapsort searches for the element in a complete binary tree.
+Heapsort is a comparison-based algorithm that uses the heap data structure (a binary heap). It is similar to selection sort. However, instead of searching for the element in a list (or an array), heapsort searches for the element in a complete binary tree.  
 The time complexity of heapsort is always O(nlogn).