Why is the worst-case complexity of Quick sort O(n²)? Explain with example.

Why is the worst-case complexity of Quick sort O(n²)? Explain with example.

From the BKSP Assistant Programmer July 2024 – Written exam, question 5 of 7.

More from this paper

Previous: What is complexity of Algorithm? Categorize complexity of Algorithm.
Next: Write SQL Query For create, insert of a table Emp (id, name, designation, Dept_name, Salary). Write SQL Query that show department wise…
All questions in BKSP Assistant Programmer July 2024 – Written