Selection Sort
Last updated
What is Selection Sort?
Selection sort is a sorting algorithm that selects the smallest unsorted item in the list and swaps it with index 0, then finds the next smallest and places it into index 1 and so on.
Free resources to learn Selection Sort
- CourseSelection Sort
- ArticleSelection Sort
- VideoSelection Sort in 3 Minutes
More in stage 5: Endianess
- Endianess
- Big Endian
- Little Endian
- Breadth First Search
- Tail Recursion
- Bubble Sort
- Pre-Order Traversal
- Depth First Search
- Non-Tail Recursion
- 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
Selection Sort: common questions
Can I learn Selection 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 Selection 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 Selection Sort tutorial for beginners?
It is lesson 51 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.