C++ STL algorithm - make_heap, pop_heap, sort_heap | Modern Cpp Series Ep. 172

►Full C++ Series Playlist: • The C++ Programming La...
►Find full courses on: courses.mshah.io/
►Join as Member to Support the channel: / @mikeshah
►Lesson Description: In this lesson I show you the 'make_heap' operation to 'heapify' your contiguous data structures. I'll also show you how to work with a custom comparator, to otherwise work with custom types. You might have also observed that previously we have covered a priority_queue (a container adaptor in the C++ standard library), which makes use of the make_heap building blocks. Finally, I'll show you how to 'heap sort' by popping off elements, or you can otherwise use the sort_heap function as well.
►UA-cam Channel: / mikeshah
►Please like and subscribe to help the channel!
►Join our free community: courses.mshah.io/communities/...

[@menachemlevi]

keep going ,i just learn this last week at university ,good job

[@MikeShah]

Cheers! Happy to hear your university teaches STL!