× Didn't find what you were looking for? Ask a question
Top Posters
Since Sunday
a
5
k
5
c
5
B
5
l
5
C
4
s
4
a
4
t
4
i
4
r
4
r
4
Home Q & A Board Science-Related Homework Help Computer Studies
New Topic  
Stromile Stromile
wrote...
Go to Answer
Posts: 299
Rep: 0 0
5 years ago
Both the insertion sort and the selection sort algorithms have efficiencies on the order of ________ where n is the number of values in the array being sorted.
a.   n
b.   n * log n
c.   n^2
d.   n^3
e.   the insertion sort has an efficiency of n and the selection sort has an efficiency of n^2
Read 62 times
1 Reply
Replies
Answer verified by a subject expert
se7ense7en
wrote...
#1
Posts: 327
Rep: 0 0
5 years ago
Sign in or Sign up in seconds to unlock everything for free
1

Related Topics

Stromile Author
wrote...

5 years ago
I appreciate what you did here, answered it right Smiling Face with Open Mouth
jmendoza
wrote...

Yesterday
Just got PERFECT on my quiz
deathDoUsPart
wrote...

2 hours ago
Smart ... Thanks!
New Topic      
Quick Reply
Explore
Post your homework questions and get free online help from our incredible volunteers
  1153 People Browsing
Start New Topic Take the Tour CoursesNew Study Tools Topics Trending Browse by Textbook
Live Chat
Related Images
  
 39
  
 223
  
 351