Jump to content

Time Complexities of Sorts

shamieh
in Homework Help

Featured Replies

Don't really need help, already know how to do what I need to do..Was just wondering if anyone knew off the top of their head the average case time complexity of

 

Linear Search

Binary Search

Selection Sort

 

To find these would I just divide by 2?

 

I only have found two so far.

 

Bubble sort = n(n+1) / 2

and

Insertion sort = n(n-1)/2 (I think)

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.