This repo contains our final project in Computer Paradigms class CSc 335 in the City College of New York taught by Professor Douglas Troeger.
This project contains an implementation of Lazy Pairing Heaps with Scheme and R5RS. The pairing heap will have its basic operations such as make-heap
, find-min
, insert
, merge
, and delete-min
The algorithm was written by Chris Panican and Gerry Xu.
DrRacket will be the program of choice.
The code on streams.rkt
can be found on Abelson and Sussman, Section 3.5. Some of the functions in this file were used to accomplish our implementation of Lazy Pairing Heaps.