TCS NQT Guide TCS NQT Coding Capability & AlgorithmsSorting Algorithms (Bubble, Selection, Insertion, Merge, Quick Sort)

Sorting Algorithms (Bubble, Selection, Insertion, Merge, Quick Sort)

Learn core concepts, essential formulas, and attempt practice questions designed on the latest TCS NQT testing patterns.

Key Concepts & Formulas

1Quadratic sorts (Bubble, Selection, Insertion) take O(N^2) time.
2Efficient divide-and-conquer sorts (Merge, Quick) take O(N log N) average time.
3Merge Sort is stable and uses auxiliary O(N) space.

Practice Question 1

Which sorting algorithm is known for partition pivots?

A) Quick Sort

B) Merge Sort

C) Bubble Sort

D) Selection Sort

Correct Answer: A) Quick Sort

Step-by-step Solution: Quick Sort partitions arrays around pivot elements, sorting subsegments recursively.

Practice Question 2

What is worst-case time complexity of Bubble Sort?

A) O(N^2)

B) O(N)

C) O(N log N)

D) O(1)

Correct Answer: A) O(N^2)

Step-by-step Solution: In the worst case (reverse sorted array), bubble sort runs nested loops comparing all pairs, taking O(N^2) time.

Merge Sort is stable, meaning it preserves the original order of equal key elements.