Bubble Sort Algorithm| Data Structures

32
17



Discussed bubble sort algorithm and its program with an example.
Time complexity has also been calculated both in BEST case and WORST case.

See Complete Playlists:

Placement Series:

Data Structures and Algorithms: https:

Dynamic Programming:

Operating Systems: //www.youtube.com/playlist?list=PLdo5W4Nhv31a5ucW_S1K3-x6ztBRD-PNa

DBMS:

Connect & Contact Me:

Facebook:
Quora:
Instagram:

#sortingindatastructure
#sortingalgorithms
#jennyslectures
#ugcnetcomputerscience

Nguồn: https://quydinh.com

Xem thêm bài viết khác: https://quydinh.com/cong-nghe

32 COMMENTS

  1. Mam aapne kaha we can modify this inner loop by replacing n-1 with n-1-i but is some cases n-1 is giving the wrong output so n-1-i is not modification but actual logic which should be used here

  2. Mam your teaching way is Great, b/c your way of teaching is best for a begginer, thanx for supporting all students by opening of this channel.
    Last thing i should say you have great…great….experience of teaching.Thanx a lot ma'am.

  3. mam you said in this video that if we take value of j=1 then j will go to <=n-1 but if take it j=1 then one element array will avoid that is arr[0]…

  4. Mam u were explain so good thanku so much ..i ll se this bubble short video ..
    I cleared all the dout..so alot of thanks mam . .thnku😊

  5. i am overwhelmed with the amount of knowledge I received from a single video,it was far better than any lectures till now.

LEAVE A REPLY

Please enter your comment!
Please enter your name here