Best to worst

A bubble sort algorithm is used to sort an array containing 20 elements.
Let \(l\) be the number of comparisons made in the best case, and
\(p\) be the number of comparisons made in the wort case.
What is the value of \(l+p\)?

×

Problem Loading...

Note Loading...

Set Loading...