Tutorial Java 5 Operasi Matematika belajar java bahasa indonesia, java, belajar, bahasa indonesia, tutorial, indonesia, eclipse, netbeans, pemrograman, java tutorial, belajar java, tutorial java bahasa indonesia, intellij, ide, object oriented programming, programming, ngoding, koding, struktur data, algoritma, dasar pemrograman, dasar-dasar pemrograman, java 8, java 9, java 10, api, jvm, jre, javac, oracle, bahasa java, kelas […]

App Link:- Programming Hub:- Telegram Channel:- Plz Subscribe My Channel???? Dont Forgot Me..

java array duplicate check, java array duplicate values, java array duplicate element, java array duplicate entries, java string array check duplicates, java check if array contains duplicates, java array detect duplicates, java array find duplicates

Absolutely brilliant. This was explained perfectly. Thank you so much. I have subscribed.

Sesh watching for interviews rn. Quality.

i have question sir in deletion if we want to delete a node from middle of a tree how shoud we do it?

Wow, I’ve always had trouble understating Heaps but your work that you did here is just brilliant. Wish I can thumbs up twice.

Another way to implement it as a data structure is to use an array but to make a filler spot for the first index, zero. That way to find the children, the formula would be either k*2 or k*2+1, personally I find this easier to implement. Good stuff professor!

during the sift down, we compare the child nodes and swap with the greatest node for a max heap , is it the same for a min heap as well ? or do we swap with the smallest node ?

Your explanation is crystal clear. Thank you. You have a good day!

sesh is the man tjang is too

Thank you for this!

This video is representing a Max-Heap data structure where the max element is always the root node. Please make sure to specify in the beginning of the video or change the title to "Implement a Max-Heap Data structure in Java". Great video though. Very informative and clear! Subscribed.

Thank you

Your explanations are really easy to understand but still concise. Bravo!

Thanks.

Mister, can you help me with my project? we need to make a GUI program that will ask the user to enter numbers he want to sort and while performing the heap sort an animation is being done.

Hi Sesh,

Great video. At 8:25, I have a question about what you mean by truncate fractional part. If you go through the proof for left and right.

that is However for right, you end up with

i – index of left i – index of right

i = 2p + 1 i= 2p + 2

you end up with you end up with

p = (i-1)/2 p = (i – 2) / 2

which makes sense

And i don't think that (i-1)/2 is the same as (i-2)/2

Can you clarify this? The way our professor taught it was start with index 1 so it makes the math easier

awesome

Excelent ! Thank you !

You are describing it very smoothly, with many examples and clear view of the problem… You are working this step by step, so anyone really can follow up (y)

You are a great teacher 🙂

It would be really nice if you can videos for Bellman Ford and Floyd Warshall too…

Thanks.

I really like how you break the idea into 2 parts, the theoretical part and then the implementation. This really makes it easy to understand. Thank you (Y)

As a computer science student, I learned more about heaps in 10 minutes then sitting in an 1.5 hour of class. Well done, presented clearly and really enjoyed.

i want to hire u bro

much simple, so concise, very clear, wow

Thanks. And a lot of homework for me 🙂

Excellent. Thank you for this great lesson. I propose a fibonacci heap lesson and graphs algorithms dijkstra, krukal, prim and also other types of tree with algorithms.

Excellent and simple fundamentals

Sift up.

You're welcome. Really glad it helped!

Thank you! Just did well on a quiz because of your video 🙂

9th November is my B'day 😀

@ 7:59 , for the right child you to use the formula " k= 2p+1" when that is the formula for the left child. For the right child, should have used the formula " k = 2p + 2" which would have yielded " (k-2) /2. For the right child, 9, at index 2, this would have been (2-2)/2 = 0.

Yes. The idea of integer division does yield the same result, but it is better to make use of the two formulas no?