Scribd Logo
Upload

Welcome to Scribd!

  • Sorting Master Class

    Uploaded by

    Monika Chavan
    9 views4 pages
    The document discusses several sorting algorithms: 1. Insertion sort - Works by iterating through an array, inserting each element into its sorted position. 2. Merge sort - Works by dividing an array into halves, sorting each half recursively, and then merging the sorted halves. 3. Selection sort - Works by iterating through an array and swapping elements to put the minimum element in the front. It provides pseudocode examples for implementing these sorting algorithms to sort integer arrays in ascending order.

    Original Description:

    sorting

    Original Title

    Sorting_Master_Class

    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
    The document discusses several sorting algorithms: 1. Insertion sort - Works by iterating through an array, inserting each element into its sorted position. 2. Merge sort - Works by dividing an array into halves, sorting each half recursively, and then merging the sorted halves. 3. Selection sort - Works by iterating through an array and swapping elements to put the minimum element in the front. It provides pseudocode examples for implementing these sorting algorithms to sort integer arrays in ascending order.

    Copyright:

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

    Sorting Master Class

    Uploaded by

    Monika Chavan
    The document discusses several sorting algorithms: 1. Insertion sort - Works by iterating through an array, inserting each element into its sorted position. 2. Merge sort - Works by dividing an array into halves, sorting each half recursively, and then merging the sorted halves. 3. Selection sort - Works by iterating through an array and swapping elements to put the minimum element in the front. It provides pseudocode examples for implementing these sorting algorithms to sort integer arrays in ascending order.

    Copyright:

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

    Q D

    Dictionary Newspaper

    words are arranged


    in systematic order sorting
    a hiver an integer array arid elements
    find elementin array
    largest
    A L 8 1,1 containing

    It sent it in ascending order


    1 2 5 7 8 9 Is
    N Al
    ans AID cc Olde
    i i N it t
    for i
    ans mare Cars Ali SC 0111
    return as

    Find second largestelement c h ÉN


    A 15 8 is I II mane is v
    man 2 1 Ans
    Tc O N TN 012N OH
    Sc 0 2 0111
    Find Kthlargestelement
    s
    A 15
    y y 7
    2,1
    y
    m2
    may I 9

    c OfK N sc E Mh Ans
    I is

    DIII
    A Is 8
    Sc Old
    As I 5,88 2,37 9 is continue this for artime
    sorted array
    selection Sant 70 042
    A 5 2 1 7 8 9 15
    Ans 70 0 KAN tofindKth
    largest

    O
    YI 2 3 4
    i 22
    5 6
    ascending order

    Insertion sort ÉrhoII


    Teddy T is is 8 I 5 I
    set
    a 213 7 8 10 15
    A
    totalshifts Yt to
    EN N
    L tyint
    I I
    Q Given a integer array all oddelements are sorted
    all eve elements are sorted soft the array

    Eg A 31 I I I I is id z ca s is a ng
    Ey l
    2 42 to

    15 t is is 4,5 scoff
    sortedA 2 3 4 9 to 05 19 Tc old
    SC
    01nA 2 3 4 5 6

    a 15,5 at t is is IT printsorted
    It I I I I I j order

    op 2 3,7 Fro Is if to scold

    Merge Sant DIC

    A 9 8 7 4
    3,16 1,5
    a 8 7 33 6 4 r s
    1

    98 7 3 16 431 i s
    I I

    h
    É tt H ec oln

    t.it

    6 7 8,93 sortedArray
    s
    139 6
    9 I
    51 6
    2 r 2 3 6

    I 2 3 4 56 is t's
    I 23
    I 4 56

    i 12 334 15 6

    Nz N2
    A
    Tc ointogjt my
    Sc Olof W23

    I 2k N
    In k logan

    You might also like