Bubble Sort
Last updated
What is Bubble Sort?
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 the list is sorted.
Free resources to learn Bubble Sort
- ArticleBubble Sort Algorithm
- VideoBubble Sort
- VideoBubble sort in 2 minutes
More in stage 5: Endianess
- Endianess
- Big Endian
- Little Endian
- Breadth First Search
- Tail Recursion
- Pre-Order Traversal
- Depth First Search
- Non-Tail Recursion
- Selection Sort
- In-Order Traversal
- Bellman Ford's Algorithm
- Insertion Sort
- Post Order Traversal
- Dijkstra's Algorithm
- Breadth First Search
- Heap Sort
- Binary Search
- A* Algorithm
- Depth First Search
- Quick Sort
- Linear Search
- Merge Sort
- Dijkstra's Algorithm
- Finding Hamiltonian Paths
- MFU Cache
- Huffman Coding
- Solving N Queen Problem
- LRU Cache
- Kruskal's Algorithm
- Maze Solving Problem
- LFU Cache
- Ford-Fulkerson Algorithm
- The Knight's Tour Problem
- Prim's Algorithm
- Rabin-Karp Algorithm
- Search Pattern in Text
- Suffix Arrays
Bubble Sort: common questions
Can I learn Bubble Sort in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Bubble Sort in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Bubble Sort tutorial for beginners?
It is lesson 47 of 188 in the free Computer Science roadmap, in stage 5, Endianess. If you are new to Computer Science, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.