A HEURISTIC APPROACH OF SORTING USING LINKED LIST

Abstract

Sorting given numbers means arranging the given numbers either in ascending order or descending order. There are various algorithms for sorting a set of numbers. These algorithms take different time to sort numbers. Sorting a given set of numbers is of prime importance. For this the time complexities of various sorting algorithms have been analyzed. Aiming at the shortcomings of various traditional algorithms and the array-indexed sorting algorithm for natural numbers, this algorithm has been developed. This new developed algorithm is based on linked list and removes the shortcomings of various sorting algorithms. Using linked list as a method of sorting has reduced the time of the algorithm.