General discussion

Locked

algorithms

By jimmy ·
Can someone please tell me what the following algorithms are?
binsort, bubblesort, merge-sort, insertsort, quicksort and selectsort.

O(n) is a insert algorithm
O(log n) is a ---algorithm
O (n log n) ?is a ---algorithm
O(n2-Squared) is a ----algorithm

an example table like this would be perfect many thanks

This conversation is currently closed to new comments.

7 total posts (Page 1 of 1)  
| Thread display: Collapse - | Expand +

All Comments

Collapse -

algorithms

by Ann777 In reply to algorithms

http://www.nist.gov/dads/HTML/bucketsort.html

quicksort, which is O(n log n) on average, running on a small desktop computer can beat bubble sort, which is O(n2)

At any rate the above site, is a good one for researching these.

Collapse -

algorithms

by jimmy In reply to algorithms

Poster rated this answer

Collapse -

algorithms

by rmaheh In reply to algorithms

o(n logn)- quick-sort
0(log n)-binsort
o(n)-insertsort
o(n2-squared)-mergesort

Collapse -

algorithms

by jimmy In reply to algorithms

Poster rated this answer

Collapse -

algorithms

by rmaheh In reply to algorithms

o(n logn)- quick-sort
0(log n)-binsort
o(n)-insertsort
o(n2-squared)-mergesort

Collapse -

algorithms

by jimmy In reply to algorithms

Thanks for the assistance

Collapse -

algorithms

by jimmy In reply to algorithms

This question was closed by the author

Back to Web Development Forum
7 total posts (Page 1 of 1)  

Related Discussions

Related Forums