diff --git a/Sorting/Heap Sort/Readme.md b/Sorting/Heap Sort/Readme.md
index c2f0a9c9..b65334a0 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).