A Comparative Study of Cocktail Sort and Insertion Sort

A Comparative Study of Cocktail Sort and Insertion Sort

Blog Article

Sorting is one of the basic operations in Computer Science.This operation is often used to meet a variety of requirements, such as processing and sorting data.It is earthbath facial wipes challenging to find the desired information in unsorted data.This is the reason why there are plenty of sorting algorithms exist to find the most efficient algorithm.

This study compares the efficiency level of Cocktail sort and Insertion sort.The efficiency level measured by the execution time or the CPU usage time.Both algorithms were tested to sort a certain amount of random data with variation amount of data.The amount of data that will be used in this research is 1500, 3000, 4500 and 6000 data using C language.

After telemarkskongen flue testing and comparing the two algorithms, cocktail sort and insertion sort, the results shows that, the Insertion sort algorithm is proven to be more efficient and faster than the Cocktail sort algorithm.