https://github.com/almogtavor/mergeable-heap
Solutions to Introduction to Algorithms Third Edition 10-2 - mergeable heaps using linked lists
https://github.com/almogtavor/mergeable-heap
c clrs introduction-to-algorithms
Last synced: about 1 month ago
JSON representation
Solutions to Introduction to Algorithms Third Edition 10-2 - mergeable heaps using linked lists
- Host: GitHub
- URL: https://github.com/almogtavor/mergeable-heap
- Owner: almogtavor
- Created: 2024-05-06T22:06:09.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-05-18T23:35:44.000Z (over 1 year ago)
- Last Synced: 2025-05-25T08:03:59.912Z (5 months ago)
- Topics: c, clrs, introduction-to-algorithms
- Language: C
- Homepage:
- Size: 29.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Mergeable heap using linked lists implementation in C
The solution to problem 10-2 from the book "Introduction to Algorithms" by CLRS.
The problem is:
```
A mergeable heap supports the following operations:
MAKE-HEAP (which creates an empty mergeable heap), INSERT, MINIMUM, EXTRACT-MIN, and UNION.
Show how to implement mergeable heaps using linked lists in each of the following cases.
Try to make each operation as efficient as possible.
Analyze the running time of each operation in terms of the size of the dynamic set(s) being operated on.
Lists are sorted.
Lists are unsorted.
Lists are unsorted, and dynamic sets to be merged are disjoint.```