What are some common algorithms and their complexities?

What are some common algorithms and their complexities?

Common algorithms include sorting algorithms like QuickSort and MergeSort, and searching algorithms like Binary Search. Their complexities vary; for example, QuickSort has an average time complexity of O(n log n), while Binary Search has O(log n).

Can you explain why QuickSort is faster than Bubble Sort?

QuickSort is faster than Bubble Sort because it uses a divide-and-conquer approach, reducing the number of comparisons and swaps needed. Bubble Sort, on the other hand, has a time complexity of O(n^2), making it inefficient for large datasets.

What is the space complexity of MergeSort?

MergeSort has a space complexity of O(n) because it requires additional space to hold the temporary arrays used during the merging process.

Are there any algorithms with constant time complexity?

Yes, algorithms like accessing an element in an array or performing a simple arithmetic operation have a constant time complexity of O(1).