1.
What is the worst-case time complexity of Quick Sort?
A
O(n log n)
B
O(n)
C
O(n²)
D
O(log n)
Loading practice questions
Browse topic-based computer-science practice sets.
3 practice sets · Page 1 of 1
What is the worst-case time complexity of Quick Sort?
O(n log n)
O(n)
O(n²)
O(log n)
Which protocol is used to assign IP addresses automatically to devices on a network?
DNS
FTP
DHCP
HTTP
What is the time complexity of accessing an element by index in an array?
O(n)
O(log n)
O(1)
O(n²)