Min and Max Heaps #15

Open
opened 2022-05-10 21:48:59 +00:00 by luke-else · 1 comment
Owner

Potential ways to distinguish:

  • Use of an Enum to separate the different types. Have a modifier to invert the comparison. Potential universal function.

  • Separate them into different classes and redefine each with separate functions (not 100% efficient)

Potential ways to distinguish: * Use of an Enum to separate the different types. Have a modifier to invert the comparison. Potential universal function. * Separate them into different classes and redefine each with separate functions (not 100% efficient)
luke-else self-assigned this 2022-05-10 21:48:59 +00:00
luke-else added this to the C# project 2022-05-10 21:48:59 +00:00
Author
Owner

From time away from the repo, I have realised it will probably be best to have the Heap represented using an Array. It will make it easier to insert new items and becuase of the way the heap is ordered, it makes it quicker to swap items back up through the heap in the event that the top item is popped.

From time away from the repo, I have realised it will probably be best to have the Heap represented using an Array. It will make it easier to insert new items and becuase of the way the heap is ordered, it makes it quicker to swap items back up through the heap in the event that the top item is popped.
Sign in to join this conversation.
No Milestone
No project
No Assignees
1 Participants
Notifications
Due Date
The due date is invalid or out of range. Please use the format 'yyyy-mm-dd'.

No due date set.

Dependencies

No dependencies set.

Reference: luke-else/DataStructuresCSharp#15
No description provided.