How do I debug my priority queue implementation?

I'm having trouble with my priority queue implementation. It doesn't seem to be ordering elements correctly.

Let's start by checking how you're inserting elements. Can you share the code for your insertion method?

Sure! Here's my insert function: insert(value, priority) { ... }. It adds elements based on priority.

Great! Make sure you're comparing priorities correctly. Are you using a min-heap or max-heap for your implementation?

I'm using a min-heap. I think the issue might be in the heapify function.

That could be it. Can you show me the code for your heapify function? We can check if it's maintaining the heap property.