Lec-46: BUBBLE SORT in PYTHON 🐍 with Code 👩‍💻 👨‍💻DSA in PYTHON 🐍

00:00 – Intro
00:19 – Bubble sort
01:00 – algorithm with example
04:10 – Best case Time complexity
06:05 – worst case time complexity

Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, indicating that the list is sorted. This video is analysis the best and worst case time complexity.

► Python For Beginners(Complete Playlist):

Other Subject-wise Playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Computer Networks :
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Architecture:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:
► Class XI Computer Science(Full Syllabus)
► Microprocessor Playlist:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[aniket-Ghosh.]

So beautiful explanation..You deserve a million likes

[priyanshujani]

Very understandable and easy explanation 🎉always looking forward to see these type of content🙏👍

[kkmr]

Thank you sir for clear explanation...

[mere_pyare_radharaman]

thanks Krishna and you... aap ni hote to ye sorting itni asan ni hoti😁😁

[abdulhussainpashuda]

#bubble sorting
arry1 = [50, 40, 30, 10]
n = len(arry1)
for i in range(n):
swapped = False
for j in range(0, n-i-1):
if arry1[j] > arry1[j+1]:
arry1[j], arry1[j+1] = arry1[j+1], arry1[j]
swapped = True
if not swapped:
break

[jc]

sir, why are you looking weak, , i mean tora patla laag rahe ho app...hope to see you in good health always🤩🤩🤩😍🥰

[vebqchc]

Can you please explain it in English sir

[WHITEVALE]

sorry but def is not defination it means
define