A simple sorting technique that scans the sorted list, starting at the beginning, for the correct insertion point for each of the items from the unsorted list… Read more »
glossary
- Sorting - sorting means arranging a list of numbers or elements in an ascending or descending order
- Divide and Conquer - dividing the problem into smaller subproblems hoping that the solutions of the subproblems are easier to find and then composing the partial solutions into the solution of the original problem.
- Complexity Analysis - Analysis of algorithms is the determination of the number of resources (such as time and storage) necessary to execute them.
- Best Case Performance - All the input elements are already sorted
- Worst Case Performance - All the input elements are Unsorted
- Average Case Performance - All the input elements are in random order
- Time Complexity - Estimates the running time , How long does this sorting program run? It possibly takes a very long time on large inputs until the program has completed its work