•This can be summarized as an O(N2)
algorithm
in the worst case.
•We should keep in mind that this means
as our
list grows larger the performance will be dramatically reduced.
•In addition, unlike the selection sort,
in the worst
case we have not only O(N2)
comparisons
but also O(N2) data moves.
