Skip to content

Fixed mistakes #465

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Fixed mistakes #465

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
510cb89
Update Readme.md
rajsukanya Oct 31, 2019
05cac5f
Update Readme.md
rajsukanya Oct 31, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions Sorting/Heap Sort/Readme.md
View file
Open in desktop
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.
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).