Scribd Logo
Upload

Welcome to Scribd!

  • Summer Semester 1 2009 CSCI-260 Data Structures Assignment # 7

    Uploaded by

    Gabriella Vetencourt
    7 views1 page
    This document outlines 4 assignments for a data structures course due on July 18, 2009. The assignments are: 1) Explain merge sort with diagrams and detail merging two sorted arrays where one is smaller, 2) Provide an example of quicksort and explain its operations, 3) Provide an example of shellsort and explain its operations, 4) Compare quicksort and shellsort, emphasizing their advantages and disadvantages.

    Original Description:

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines 4 assignments for a data structures course due on July 18, 2009. The assignments are: 1) Explain merge sort with diagrams and detail merging two sorted arrays where one is smaller, 2) Provide an example of quicksort and explain its operations, 3) Provide an example of shellsort and explain its operations, 4) Compare quicksort and shellsort, emphasizing their advantages and disadvantages.

    Copyright:

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

    Summer Semester 1 2009 CSCI-260 Data Structures Assignment # 7

    Uploaded by

    Gabriella Vetencourt
    This document outlines 4 assignments for a data structures course due on July 18, 2009. The assignments are: 1) Explain merge sort with diagrams and detail merging two sorted arrays where one is smaller, 2) Provide an example of quicksort and explain its operations, 3) Provide an example of shellsort and explain its operations, 4) Compare quicksort and shellsort, emphasizing their advantages and disadvantages.

    Copyright:

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

    Summer Semester 1 2009

    CSCI-260 Data Structures


    Assignment # 7

    Due: July 18, 2009

    1. Explain the merge sort the Java code explained in class. Be very specific and use diagrams to
    clarify the operations. As a special case, give details of linear-time merging of two sorted
    arrays A and B where array A is smaller that array B.

    2. Find or create your own example of the Quick sort and explain its operations.

    3. Find or create your own example of the Shell sort and explain its operations.

    4. Compare the Quick and the Shell sort methods. Emphasize their advantages and
    disadvantages. Be very specific.

    You might also like