Bubble Sort Code in Java | DSA

Check out our courses:

Coupon: TELUSKO10 (10% Discount)

Coupon: TELUSKO20 (20% Discount)

For More Queries WhatsApp or Call on : [phone]

Udemy Courses:

[monishas]

07:53 sir we can make outer loop condition i<size-1 so that no need to sort the first element, since elements other than first element are sorted.

[CodingChannel]

Sir you are a blessing for Java-Coders 🙏

[gandamraviteja]

Bubble sort might not efficient but your explanation is very efficient Alien 😄

[nmurthyTester]

Outer loop condition is wrong. It should be i<size-1

[LogeshCool]

your explanation is very nice and brief keep going👍👍

[reddyryals]

Sir pls do python DSA also 😢😢 you are explaining well Sir

[shaikmaaheed]

upload content faster. with same quality.
excellent work keep it up.

[rajeshpakkala]

Please teach daily sir... upload classes daily sir

[naveenalla]

sir i would like to start learning spring-boot and i am perfect with oops, collection and a little bit about threads and no practive with jdbc and jsp. Can i start to learn spring-boot, what is your suggestion sir?

hope you reply sir!

[sohailshah]

As a python developer, we don't need to apply these concepts because we have built in function called sort() which follow Timsort concept but these concepts are literally fun and easy to understand

[boggart]

Another way to make it more efficient is to check whether the array is already sorted. This can be done by using a boolean 'swapped' (say) and initialize to to false. reset it to false outside the inner loop. Now if values are swapped in an iteration, mark it to true. Check outside the inner loop if the boolean is true. If it true, it means that at least one pair was swapped and there might be more. If it false, it means that array is already sorted and you can 'break' out of the loop already.

[dragonbooster]

Sir make detailed explanation
I cant understand the part of when you added i to reduce the waste iterations

Sir dont consider time

Consider quality.