- 1
- 17 454
Kevin S
เข้าร่วมเมื่อ 10 ต.ค. 2011
Bubble Up and Bubble Down Heap Insertion
This is a Khan Academy style tutorial video explaining bubble up and bubble down algorithms for inserting and sorting values in a min heap. We made this for our algorithms class at The College of New Jersey.
(Kevin Stys, Matt Bottone, George Wallden)
(Kevin Stys, Matt Bottone, George Wallden)
มุมมอง: 17 459
Heaps are not binary search trees, this is a very misleading statement.
What is the final answer of the bubble up , Is it [1,2,6,3,5,8,9,4,7] ??
Thank you very much!
Why only bubble up sorts for building of the tree, why can't I use bubble down to sort for building of the tree?
Can you please explain the bubble down method for bubble sort
you'd make a great drill instructor in the marines bro lol, but this is software
Bubble Buddy would be proud