Selection Sort in Python — Python Technical Interview Questions & Answers

Selection Sort in Python

Selection Sort in Python

  • Selection Sort orders a list. Say the idea in plain words, then complexity. Bubble/insertion/selection are O(n²) teaching sorts. Merge and heap are O(n log n). Python’s built-in sort is Timsort (O(n log n), very fast in practice).
  • Dry-run Selection Sort on a tiny list like [4, 1, 3, 2] on the board. Interviewers care that you can trace one pass, not that you recite a textbook page.
  • For Selection Sort in real code: sorted(a) / a.sort() is what you use. Write the algorithm only when they ask you to implement it.
  • Selection Sort in Python — output: [1, 2, 3, 4]. Each pass picks the smallest remaining.

Technical Interview Tip: Idea + complexity + one tiny trace. Then say when to use built-in sort.

Code Examples for Selection Sort in Python

Example

# Selection Sort in Python
a = [4, 1, 3, 2]
for i in range(len(a)):
    m = i
    for j in range(i + 1, len(a)):
        if a[j] < a[m]:
            m = j
    a[i], a[m] = a[m], a[i]
print(a)

Selection Sort in Python — output: [1, 2, 3, 4]. Each pass picks the smallest remaining.

How to Explain Selection Sort in Python to an Interviewer

Explain Selection Sort as if you are teaching a junior — definition, then one tiny script.

Selection Sort puts items in order. Selection Sort — know idea + O(...).

What does the example print, and why?

Selection Sort in Python — output: [1, 2, 3, 4]

What mistake do freshers make with Selection Sort?

Selection Sort — real code uses sorted() / Timsort.