Skip to content

Commit

Permalink
Fix grammar mistakes
Browse files Browse the repository at this point in the history
See issue Asiatik#450
  • Loading branch information
ev-john authored Oct 21, 2019
1 parent 63e5087 commit 2978979
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion Sorting/Heap Sort/Readme.md
Original file line number Diff line number Diff line change
@@ -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).

0 comments on commit 2978979

Please sign in to comment.