COMPARATIVE COMPLEXITY STUDY OF BUBBLE SORT AND INSERTION SORT USING JAVA PROGRAMMING LANGUAGE

A REVIEW

Abstract

This research paper presents the review of the computational complexity of bubble sort and insertion sort; the run-time performances of bubble and insertion sort were evaluated, and the comparisons of the time complexity of both sorts were also analyzed. These two algorithms was the area of focus for this research and the result practically proved that bubble sort is not better compare to insertion sort and therefore agreed that the best performing algorithm in terms of the best case, average case, and worse case is insertion sort. The research also provides a drawback to the bubble sorting algorithm because it keeps sorting the input data even if they are arranged at their normal positions.