See the world from my eyes...
Saturday, September 10, 2016
C# Implementation of Heap Sort
The code create the maxheap of the given array of size N and then swap the 0th index (max value) with the last index (N-1) and then again create maxheap with reduced array of size (N-1).
Continue this process unless complete array is sorted.
1 comment:
Teknik Informatika
said...
are the results of this process issued?
August 20, 2022 at 1:01 AM
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
1 comment:
are the results of this process issued?
Post a Comment