Scribd Logo
Upload

Welcome to Scribd!

  • DSA Assignment 2 PDF

    Uploaded by

    muskan
    23 views1 page
    This document provides instructions for Assignment 2 which requires explaining 8 sorting algorithms with examples and comparisons counts, writing the algorithms on paper, and submitting all answers in one PDF file. 10 marks are allocated for explaining the algorithms and examples and 10 marks for writing out the algorithms on paper. Programming is not required. The 8 algorithms to be covered are selection sort, insertion sort, bubble sort, quick sort with worst and best cases, merge sort, counting sort, radix sort, and bucket sort.

    Original Description:

    Original Title

    DSA Assignment 2.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
    This document provides instructions for Assignment 2 which requires explaining 8 sorting algorithms with examples and comparisons counts, writing the algorithms on paper, and submitting all answers in one PDF file. 10 marks are allocated for explaining the algorithms and examples and 10 marks for writing out the algorithms on paper. Programming is not required. The 8 algorithms to be covered are selection sort, insertion sort, bubble sort, quick sort with worst and best cases, merge sort, counting sort, radix sort, and bucket sort.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    23 views1 page

    DSA Assignment 2 PDF

    Uploaded by

    muskan
    This document provides instructions for Assignment 2 which requires explaining 8 sorting algorithms with examples and comparisons counts, writing the algorithms on paper, and submitting all answers in one PDF file. 10 marks are allocated for explaining the algorithms and examples and 10 marks for writing out the algorithms on paper. Programming is not required. The 8 algorithms to be covered are selection sort, insertion sort, bubble sort, quick sort with worst and best cases, merge sort, counting sort, radix sort, and bucket sort.

    Copyright:

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

    Assignment 2 Marks:20

    All answers need to be in one pdf.

    -> Explain each algorithm with an example and mention total comparisons required in each (10
    marks)
    -> Write algorithm for each in paper (10 marks)

    *You DONT have to write C program*

    SORTING
    1) Selection Sort

    2) Insertion Sort

    3) Bubble Sort

    4) Quick Sort
    Also explain worst case and best case

    5) Merge Sort

    6) Counting Sort

    7) Radix Sort

    8) Bucket Sort

    You might also like