Dsa weekend quiz

1)What is the time complexity of appending an element to the end of an array in Python?
a) O(1)
b) O(n)
c) O(log n)
d) O(n^2)

2)Which sorting algorithm is based on the divide-and-conquer strategy?
a) Bubble Sort
b) Insertion Sort
c) Quick Sort
d) Selection Sort

1 Like