Create a Table of Sorting Algorithms DAT 210 Top of Form

Top of Form Bottom of Form

NAME Description Benefits and uses Disadvantages Bubble Sort Time complexity: O(N2)

This algorithm works by repeatedly comparing and swapping adjacent elements if they are not in the correct order. This is the most basic of the sorting algorithms and it the most slow when it comes to practical use.

Easy to implement.

Requires not extra storage as it is an in-place algorithm.

Coding used is very small and is good for beginners, best used for beginners. This algorithm is not suitable for huge lists of items or real-time applications. Insertion Sort Time Complexity: O(N)

A comparison-based algorithm, is not the best when it comes to efficiency, but the power of it is really...