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 the difference between O(n) and O(log n)?

Sure! O(n) means the time complexity grows linearly with the input size, while O(log n) means it grows logarithmically, which is much faster for large inputs.

What about space complexity?

Space complexity measures the amount of memory an algorithm uses relative to the input size. For instance, MergeSort has a space complexity of O(n) due to the temporary arrays it creates.

Are there any algorithms with constant time complexity?

Yes, algorithms like accessing an element in an array have a constant time complexity of O(1), meaning the time taken does not change with the input size.