search

Tanmay-901 / Cpp-Algorithms

Algorithms with better Time and Space complexity.
1 stars 3 forks source link

Heap sort implemented with Avg and worst time complexity of O(nlogn) #7

Closed kaustavy2k closed 4 years ago

kaustavy2k commented 4 years ago

Avg time complexity=O(nlogn) Worst time complexity=O(nlogn) Memory=O(1) Stability=No Method=Selection

Tanmay-901 commented 4 years ago

@kaustavy2k kindly add more comments to your code so as to make it more understandable (even for beginners), and please apply proper indentations and spaces to your code along with usage of good variable names (although after adding comments to the code, it shouldn't remain an issue). These factors are key to good quality code.

kaustavy2k commented 4 years ago

i have added all the proper indentations with proper comments. Please merge my code