Medzi triediace algoritmy využívajúce operáciu porovnaia triedených prvkov nepatria:
Vyberte aspoň jednu odpoveď.
a. Heap sort
b. Radix sort **
c. Merge sort **
d. Quick sort
e. Bubble sort **
nechapem preco tak, vsak buble porovnava prvky.... jak to ma bytspravne?
100%tne to ma byt takto je to napisane vo vokiho skriptach... aj ked keby som to nevidel tak dam ruku do ohna ze bubble sort by nemalo byt
_____________________________________________________
odporucam si pozriet este jednu vec... som na to videl otazky :
Quicksort
Worst case performance Θ(n2)
Best case performance Θ(nlogn)
Average case performance Θ(nlogn) comparisons
BubbleSort
Worst case performance O(n2)
Best case performance O(n)
Average case performance O(n2)
MergeSort
Worst case performance Θ(nlogn)
Best case performance Θ(n)
Average case performance Θ(nlogn)
InsertionSort
Worst case performance О(n2)
Best case performance O(n)
Average case performance О(n2)
HeapSort
Worst case performance O(nlogn)
Best case performance O(nlogn)[1]
Average case performance Θ(nlogn)