My Learning
Cart
Sign In
Categories
Current Affairs & GK
Current Affairs
Show All Current Affairs & GK
eBooks
General Aptitude
Arithmetic Aptitude
Data Interpretation
Show All General Aptitude
General Knowledge
Basic General Knowledge
General Science
Show All General Knowledge
Medical Science
Anatomy
Biochemical Engineering
Biochemistry
Biotechnology
Microbiology
Show All Medical Science
Technical
Database
Digital Electronics
Electronics
Networking
Show All Technical
Verbal and Reasoning
Logical Reasoning
Verbal Ability
Verbal Reasoning
Show All Verbal and Reasoning
Computer Science & IT
Data Structures & Algorithms
Sorting Algorithms: Quick, Merge, Heap - Problem Set
Sorting Algorithms: Quick, Merge, Heap - Problem Set
Download Q&A
Q.
Which of the following is a characteristic of the Quick Sort algorithm?
A.
It uses a pivot element
B.
It is always stable
C.
It requires O(n^2) space
D.
It is a non-recursive algorithm
Show solution
Solution
Quick Sort uses a pivot element to partition the array into subarrays.
Correct Answer:
A
— It uses a pivot element
Learn More →
Showing 1 to 1 of 1 (1 Pages)
Soulshift Feedback
×
On a scale of 0–10, how likely are you to recommend
The Soulshift Academy
?
0
1
2
3
4
5
6
7
8
9
10
Not likely
Very likely
✕
↑
