In this video, I will explain Bubble sort algorithm with an example in Hindi.
Simple Bubble sort Algorithm example by Kailash Joshi

Bubble sort में, array के प्रत्येक तत्व की तुलना उसके adjacent तत्व से की जाती है। algorithm passes में सूची को process करता है। n तत्वों के साथ एक सूची को sorting के लिए n-1 passes की आवश्यकता होती है। ... सूची का सबसे छोटा तत्व सूची के पहले index में रखा जाता है।

Data Structure - Bubble Sort Algorithm. Bubble sort is a simple sorting algorithm. This sorting algorithm is a comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order.

next tutorials:
selection sort in a data structure in Hindi

insertion sort in a data structure in Hindi

quicksort in a data structure in Hindi

heap sort in a data structure in Hindi

merge sort in a data structure in Hindi

bubble sort algorithm in data

More videos :

How to Download Turbo C++: https://www.youtube.com/watch?v=y8l3Pgzjfck

Data Structure Tutorial Playlist: https://www.youtube.com/playlist?list=PLqcuf9-ILPYBlPvUk8lTJu2tJV2Y9gKL4

Please Like Share and Subscribe
CSE Gyan
Cs Engineering Gyan
Teacher: Kailash Joshi
Editor: Bipin Chandra
Thank You