Insertion Sort

ByWalter Wimberly

An insertion sort is a bit of a special case. It assumes that you will be given a set of values over time, and as you get them, you will insert the value into its correct location based upon the given values.

Depending upon the data, and size, you could utilize different types of sort, such as a binary tree so it is automatically sorted as it enters, or bubble sort. 

While normally a bubble sort isn’t considered a good sorting algorithm, it can be very effective for an insertion sort because it’s only checking for the placement of one element, and you can exit the sort once the data is sorted. This can make it relatively fast for insertion sorts, assuming that you are not loading a lot of data at once with it.

This makes sense to sort your data as it’s being inserted, so that it is always sorted when you go to work with it.

Insertion Sort was originally found on Access 2 Learn

Assistant Professor

Walter Wimberly is an Assistant Professor at a regional college in Tennessee, teaching Computer Science in the Software Engineering track. He works as a student advisor, oversees curriculum changes, develops new courses, and manages the advisory panel.
Walter taught full time for about 7 years, before going back into “industry” as a full stack Software Developer for a dozen years. There he focused on web based projects coding in JavaScript/jQuery and utilizing the Bootstrap CSS Framework on the front-end, and coding in PHP, ASP/ASP.Net, SQL on the back-end.

Since he loves teaching, he taught as an adjunct web and digital media classes for eight (8) years, while working in industry, and has since returned to teaching full time.

He has been married for over 25 years, and is father to several special needs boys. As such, he is working on some projects to help others who have special needs to be self-sufficient, and support the care givers of those with special needs. Check out his Autism blog for more info.

Similar Posts

  • Problems with JSON

    ByWalter Wimberly

    No system, file format, data format, programming language, etc is perfect. However, instead of glossing over the information, it’s better to education oneself as to their shortcomings to ensure that you can work around the limitations. It is worth noting that while JSON is built as a subset of JavaScript it does not include support…

  • Data Transformations

    ByWalter Wimberly

    Data transformation is often simple like splitting a full name into the first and last, or vice versa. However, sometimes it is more complicated, much more complicated. I once wrote a data converter which had to convert data stored in a file with the size of data store being a certain number of bytes into…

  • O(n log n) Algorithms

    ByWalter Wimberly

    A linear O(n log n) algorithm is a type of algorithm that has a time complexity of O(n log n), where ‘n’ represents the number of elements in the input data. This means that the running time of the algorithm increases linearly with the size of the input, but with an additional logarithmic factor. Now…

  • Binary Search

    ByWalter Wimberly

    If our data is pre-sorted then a binary search starts to make a lot of sense. It is like the guessing game we mentioned earlier where you need to find a number between 1 and 100. No one asks for 1, then 2, then 3… until they find it. Instead we ask for the mid…

  • Linear O(n) Algorithms

    ByWalter Wimberly

    After a Constant Time Algorithm, and the Logarithmic Algorithms, the linear algorithm, often referred to as an O(n) algorithm in the Big O notation, is the next fastest. When an algorithm has a time complexity of O(n) the algorithm increases linearly with the size of the input. Inputs are often thought of as an array,…