Which of these are correct? worst and best case run time for insertion and merge sort?
insertion sort (best case): big O(n) or theta (n)
(worst case):big O(n^2) or theta (n^2)?
merge sort (best case) : big O(n log n) or theta (n log n)
(worst case) : big O (n log n) or theta (nlog n)?