Skip to content
/ heap-sort Public

Implements min-heap data structure and the heap sort sorting algorithm.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

optimalsword/heap-sort

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
.idea
.idea
 
 
cmake-build-debug
cmake-build-debug
 
 
CMakeLists.txt
CMakeLists.txt
 
 
Heap.cpp
Heap.cpp
 
 
Heap.h
Heap.h
 
 
README.md
README.md
 
 
heap_sort.cpp
heap_sort.cpp
 
 
main.cpp
main.cpp
 
 

Repository files navigation

Heap Sort Data Structure

The min-heap data structure provided is implemented such that for each node in the binary tree, each node in its subtree is less than it. This is true recursively for every subtree. It is mostly exception safe and efficient Can be used to make many algorithms, such as Dijskstra's algorithm for the shortest path, more efficient

Implemented using a vector rather than trying to implement a simulated binary tree with nodes

Heap Sort

The actual algorithm to sort a given container. Uses the min-heap data structure to keep track of the minimum element in an efficient manner O(nlogn) run time.

About

Implements min-heap data structure and the heap sort sorting algorithm.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages