Abstract
Abstract. Sorting algorithms are used to sort a list of data. Also sorting is used in other computer operations such as searching, merging, and normalization. Since the sorting is considered as a one of the key operation in computer science, recognition of an optimization approaches can develop this science considerably. Optimization in the sorting algorithms, even in small scale, can cause saving a lot of time. The main discussion of the paper is on those algorithms which present optimized versions of classical sort algorithms. We studied classical and optimized methods some of sorting algorithm such as Selection sort, Bubble sort, Insertion sort, Quick sort and Heap sort and compared each algorithm in terms of the running times when used for sorting arrays of integers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
