DAT305_wk1_Create_a_Table_of_Sorting_Algorithms.docx Create a Table of Sorting Algorith

DAT305_wk1_Create_a_Table_of_Sorting_Algorithms.docx    Create a Table of Sorting Algorithms  DAT 210    NAME  Description  Benefits and uses  Disadvantages  Bubble Sort  Time complexity: O(N^2)  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 simple. This is a stable algorithm but what makes it different is the time complexity.   When sorting just a few numbers, this algorithm is best.   This algorithm works best when the numbers area somewhat sorted beforehand.