Feedback on heaps, priority queues, and integer sorting algorithms

[Anisha7]

Great work on completing these challenges. Here's some feedback to improve your code:

• [x] For priority queues: In the front() method, your return’s get_min() function will return the tuple (priority, item) but you are returning the 0th index which will be the priority. Don’t you want to return the item here? Same for your dequeue() and push_pop() methods. Returning the item in the tuple (which is at index 1, not 0) for all of these functions will fix your priority queue implementation.
• [ ] Your counting sort fails tests. Try running pytest sorting_test.py::IntegerSortTest to see what errors you get and reach out if you need help debugging.

[noltron000]

Hi @Anisha7, for your second point I tried to run pytest and saw no errors, so I'm not sure where to start with that. I'll see what I could do, but I'll be working on your first point right now.

Running pytest

I included a screenshot for the second point.

[noltron000]

Fixed first point with https://github.com/noltron000/trees-sorting/commit/c7f863215b92aa7a26c075f02417e37043547d7c