order the algorithms from worse to best
This commit is contained in:
parent
6ff4147448
commit
369f41c886
24
src/sort.c
24
src/sort.c
@ -325,36 +325,42 @@ int main (int argc, char **argv) {
|
||||
}
|
||||
}
|
||||
|
||||
if (merge) {
|
||||
start_sort("Merge sort corriendo... ", n);
|
||||
merge_sort(work_array, n);
|
||||
end_sort();
|
||||
}
|
||||
|
||||
// O(nlog(n))
|
||||
if (quick) {
|
||||
start_sort("Quick sort corriendo... ", n);
|
||||
quick_sort(work_array, n);
|
||||
end_sort();
|
||||
}
|
||||
|
||||
if (bubble) {
|
||||
start_sort("Bubble sort corriendo... ", n);
|
||||
bubble_sort(work_array, n);
|
||||
// O(nlog(n))
|
||||
if (merge) {
|
||||
start_sort("Merge sort corriendo... ", n);
|
||||
merge_sort(work_array, n);
|
||||
end_sort();
|
||||
}
|
||||
|
||||
// O(nlog2(n))
|
||||
if (bitonic) {
|
||||
start_sort("Bitonic sort corriendo... ", n);
|
||||
bitonic_sort(work_array, n);
|
||||
end_sort();
|
||||
}
|
||||
|
||||
// O(n+k)
|
||||
if (count) {
|
||||
start_sort("Count sort corriendo... ", n);
|
||||
count_sort(work_array, n);
|
||||
end_sort();
|
||||
}
|
||||
|
||||
// O(n^2)
|
||||
if (bubble) {
|
||||
start_sort("Bubble sort corriendo... ", n);
|
||||
bubble_sort(work_array, n);
|
||||
end_sort();
|
||||
}
|
||||
|
||||
// O(n^2)
|
||||
if (selection) {
|
||||
start_sort("Selection sort corriendo... ", n);
|
||||
selection_sort(work_array, n);
|
||||
|
Loading…
Reference in New Issue
Block a user