Heap Priority Queue
CS 211- Fundamentals Of CS 2
- Implements priority queue of comparable objects using a while min-heap represented as an array.
- Uses modified bubble sort to maintain order of elements.
Hardworking and passionate job seeker with strong organizational skills eager to secure entry-level software development positions. Ready to help team achieve company goals.
Languages
Tools