I read an example:
Insert 4, 9, 3, 7, 1 into a min heap (array implementation). then 5 times run remove smallest. number of exchange among t
4, 9, 3, 7, 1
5