Bubble sort algorithm

❤❤❤good sir

Thank you for your nice explanation

This is an amazing video. Bravo.

if a already sorted array is given, then time complexity will be O(1) ryt, why O(n)

Friend, Jesus loves you. He came to save you from your sins and hell.❤️
He died so that you can have a close personal relationship with God through Him.
Jesus came to give you life and purpose.❤️
Friend, the best friend to have is Jesus.
It doesn't matter what you're struggling with, Jesus came set you free.
Accept Jesus today as your personal Lord and Savior.❤️
The Bible says in Romans 10:9 that if you believe in your heart and confess with your mouth... You shall be saved.
Say this prayer with mouth and believe it in your heart by Faith and you're saved.

Say 'Lord Jesus, have mercy on me, I've sinned and come short of your glory. Please forgive me. I believe that you died on the cross of Calvary for me and rose on the 3rd day. Save me Lord Jesus. Give me the grace to live for you till the end. Don't let me fall away. Keep me in your will and sustain me in your grace, in Jesus Name. Amen'

If you've done this, welcome friend. You're now a member of the body of Christ.

It doesn't end there, though. Develop a personal relationship with God by praying to Him and reading your Bible daily and make conscious effort not to go back to your former life.❤️

Join a Bible Believing Faith church close to you & become a part of the physical body of Christ.❤️

God will give you the grace to live for Him till the end in Jesus Name. Amen.❤️

What an incredible explanation

Thank you for the efficient lecture.

interrrnal pointerrrr

Thankkuu so muchh ser... Finally i found itt🥹❤️

This is beautiful!

staight to the point and perfect thanks

This is the best channel for learning algorithm and data structure. I am coming back here after 5 years

Thanks a lot man i tried a lot pf vidoes to understand it and this is what helped me understand how it really works

I feel like being back in school reading stuff on the almighty overhead projector

The polinomial equation should be Cn² - 2Cn + C

Even it is 9 year old . This video was very helpful.
Thanks for sharing you've got a new subscriber :)

best video on bubble sort ,concise and clear

Very good explanation and tutorial on time efficiency.

21:9 nice :o

this videos are much more better than the paid ones thank you sir you are really doing great work

best videos i have ever found for dsa

you are great you make me feel not just to understand rather to feel.

WHAT IS 'K ' IN HERE .......?

Please, explain more elaborately. i=0 to n-2 is too vague! Bullshit.

how multiple passes are happening when for loop is made only for 1?!

Thanks for such depth explaination

If this kind of faculty we have in our college there is no need of coaching.

Will the time complexity in the best scenario still be n if we don’t add the flag condition?

Best

Your Chanel Is Best For Pograming

perfect!

1st bolday bhai 1th nai hota kuch

Yes

Thank you very much

Does someone know what is k in this case? What does it stand for?

If you don't understand this video see my video why two for loop used in bubble sort

The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
**How the answer comes out to be 4.**
Detailed explanation would be appreciated.

When you reach for O(n), i'm shocked because I had never seen this version of bubble sort .. hatsoff to you.

According to views of this playlist seems like merge sort is a hot topic.

The video is unplayable.

How second time complexity becomes n-1 it should be n-2 ri8 clear my doubt

Thank you,