It's been a while since my undergraduate and I've forgotten how fun my Computer Science degree was.
I'm re-reading Introduction to Algorithms and having quite a lot of fun with it.
The latest chapter I went over was the chapter on heaps. So I decided to implement some of the data structures and algorithms.
Here is my code for creating heaps (both max and min-heaps) and heap sort.
https://gist.github.com/wmwong/6747122#file-heap-rb
I also created a test file.
https://gist.github.com/wmwong/6747122#file-heap_test-rb
Also introduced along with heaps are priority queues as they go really well together. Here are my implementations for a max and min-priority queue.
https://gist.github.com/wmwong/6747122#file-priority_queue-rb
And of courses tests!
https://gist.github.com/wmwong/6747122#file-priority_queue_test-rb
No comments:
Post a Comment