Selection Sort
Selection Sort is a algorithm in the sorting family. This sorting algorithm rearranges values into an ordered sequence using a specific comparison/distribution strategy.
ابدأ بهذا النموذج الذهني
Selection Sort is a algorithm in the sorting family. This sorting algorithm rearranges values into an ordered sequence using a specific comparison/distribution strategy.
كيف يعمل، بلا مصطلحات زائدة
Selection Sort should be understood through its invariant and the state it changes at each step.
The practical complexity in this reading is O(n²); always connect that cost to the actual loops, recursion, data structure operations or input assumptions.
اقرأ الخوارزمية كسلسلة من القرارات
Understand what one pass/partition/merge guarantees.
Track which region is already finalized.
Reason about comparisons, swaps/moves and extra memory.
Read a tiny input by hand and write down the state after every important operation. For Selection Sort, the goal is to make the invariant visible rather than to memorize code.
function selectionSort(input) {
const a = [...input];
for (let i = 0; i < a.length - 1; i++) {
let min = i;
for (let j = i + 1; j < a.length; j++) {
if (a[j] < a[min]) min = j;
}
[a[i], a[min]] = [a[min], a[i]];
}
return a;
}لا تحفظ الصياغة. تتبع الحالة التي تتغير في كل سطر واربطها بالثابت الموضح أعلاه.
O(n²)
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
مناسب لـ
- Choose based on input size, order, key range, stability and memory limits.
ما الذي يسوء عادةً
- Comparing only average Big-O.
- Forgetting stability, in-place behavior, recursion depth or key-domain assumptions.
صيغة إجابة احترافية
A strong interview explanation of Selection Sort should cover the problem it solves, its invariant, the important data structure/state, its O(n²) cost, and the constraint that would make you choose a different approach.
What problem does Selection Sort solve?
Selection Sort is a algorithm in the sorting family. This sorting algorithm rearranges values into an ordered sequence using a specific comparison/distribution strategy.
ماذا يجب أن أذكر عن التعقيد؟
Its typical cost here is O(n²), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
ما الخطأ الأكثر شيوعاً؟
Comparing only average Big-O.