Time and space complexities of various sorting methods?

Bubble sort-O(n*n)-in all cases

Insertion sort-O(n*n)-in avg and worst case in best case it is O(logn)

Quick Sort-0(nlogn)-in avg n best case and 0(n*n)-in Worst case

selection sort-same as bubble

Linear search-o(n)

Binary Search-o(nlog)

Any doubt mail me-jain88visionary@rediffmail.com