Scribd Logo
Upload

Welcome to Scribd!

  • Report PDF

    Uploaded by

    Nihar Patil
    4 views3 pages
    1. Different sorting algorithms perform best depending on the number of elements, with quick sort being best for large sets but having the most comparisons, and insertion sort being best for small sets. 2. Merge sort requires the fewest comparisons while timsort is generally the fastest algorithm. 3. Heap sort improves on selection sort by taking the same number of comparisons as merge sort but is slower.

    Original Description:

    Original Title

    report.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. Different sorting algorithms perform best depending on the number of elements, with quick sort being best for large sets but having the most comparisons, and insertion sort being best for small sets. 2. Merge sort requires the fewest comparisons while timsort is generally the fastest algorithm. 3. Heap sort improves on selection sort by taking the same number of comparisons as merge sort but is slower.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views3 pages

    Report PDF

    Uploaded by

    Nihar Patil
    1. Different sorting algorithms perform best depending on the number of elements, with quick sort being best for large sets but having the most comparisons, and insertion sort being best for small sets. 2. Merge sort requires the fewest comparisons while timsort is generally the fastest algorithm. 3. Heap sort improves on selection sort by taking the same number of comparisons as merge sort but is slower.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    SORTING ALGORITHM ANALYSIS

    Observations:
    1. Quick Sort is best for Large number of elements, but it also has highest number of comparisons
    2. Merge Sort requires least number of comparisons.
    3. Insertion Sort is best for small number of elements irrespective of randomly ordered elements or
    sorted elements or reverse sorted element.
    4. Tim sort is faster for reverse sorted array than randomly ordered array.
    5. Tim sort is fastest among all the sorts.
    6. Heap sort is better version of selection sort. It takes same number of comparisons as of merge sort,
    but takes more time.

    No of Comparisons Graph for Randomly Generated Element


    No of
    Selection
    Insertion
    Merge Sort
    Quick
    Compariso Sort
    Sort
    Sort
    n
    10
    45
    13
    18
    37
    20
    190
    23
    43
    158
    50
    1225
    73
    145
    800
    100
    4950
    136
    341
    3446
    300
    44850
    462
    1254
    28480
    500
    124750
    758
    2338
    77195
    1000
    499500
    1508
    5169
    313168

    heap
    sort
    35
    106
    370
    936
    3669
    6805
    15589

    You might also like