Scribd Logo
Upload

Welcome to Scribd!

  • For All Cases. For All Cases. For All Cases. For All Cases.: Assignment-1

    Uploaded by

    Ashutosh Acharya
    10 views1 page
    This document contains instructions for an algorithm lab assignment asking students to write C programs to analyze the time complexity of 4 sorting algorithms - insertion sort, selection sort, bubble sort, and counting sort - and to plot graphs of each algorithm's time complexity for different test cases. Students are to analyze and graph the time complexity of each sorting algorithm individually.

    Original Description:

    Original Title

    Assignment-1.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains instructions for an algorithm lab assignment asking students to write C programs to analyze the time complexity of 4 sorting algorithms - insertion sort, selection sort, bubble sort, and counting sort - and to plot graphs of each algorithm's time complexity for different test cases. Students are to analyze and graph the time complexity of each sorting algorithm individually.

    Copyright:

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

    For All Cases. For All Cases. For All Cases. For All Cases.: Assignment-1

    Uploaded by

    Ashutosh Acharya
    This document contains instructions for an algorithm lab assignment asking students to write C programs to analyze the time complexity of 4 sorting algorithms - insertion sort, selection sort, bubble sort, and counting sort - and to plot graphs of each algorithm's time complexity for different test cases. Students are to analyze and graph the time complexity of each sorting algorithm individually.

    Copyright:

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

    Motilal Nehru National Institute of Technology Allahabad, Prayagraj

    Computer Science and Engineering Department


    Algorithm Lab (CS-4A)
    Assignment-1

    Q-1: Write a C program to analyze the time complexity of insertion sort algorithm. Also plot their graph
    for all cases.
    Q-2: Write a C program to analyze the time complexity of selection sort algorithm. Also plot their graph
    for all cases.
    Q-3: Write a C program to analyze the time complexity of bubble sort algorithm. Also plot their graph
    for all cases.
    Q-4: Write a C program to analyze the time complexity of counting sort algorithm. Also plot their graph
    for all cases.

    You might also like