Scribd Logo
Upload

Welcome to Scribd!

  • 10 4 8 13 9 22 2 0 1 2 3 4 5 6 Inter Change Sort

    Uploaded by

    nguoiamphuazz
    6 views5 pages
    The document describes various sorting algorithms including insertion sort, selection sort, bubble sort, and quicksort. It provides examples of each algorithm sorting an array of numbers by iteratively comparing and swapping elements into ascending order.

    Original Description:

    Original Title

    10

    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
    The document describes various sorting algorithms including insertion sort, selection sort, bubble sort, and quicksort. It provides examples of each algorithm sorting an array of numbers by iteratively comparing and swapping elements into ascending order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    6 views5 pages

    10 4 8 13 9 22 2 0 1 2 3 4 5 6 Inter Change Sort

    Uploaded by

    nguoiamphuazz
    The document describes various sorting algorithms including insertion sort, selection sort, bubble sort, and quicksort. It provides examples of each algorithm sorting an array of numbers by iteratively comparing and swapping elements into ascending order.

    Copyright:

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

    10 4 8 13 9 22 2

    0 1 2 3 4 5 6

    Inter change sort

    I = 0; j = I + 1

    2 10 8 13 9 22 4
    0 1 2 3 4 5 6

    I = 1; j = I + 1

    2 4 8 13 9 22 10
    0 1 2 3 4 5 6

    I = 2; j =I + 1

    2 4 8 13 9 22 10
    0 1 2 3 4 5 6

    I = 3; j = I +1

    2 4 8 9 13 22 10
    0 1 2 3 4 5 6

    I = 4; j = I + 1

    2 4 8 9 10 22 13
    0 1 2 3 4 5 6

    I = 5; j = I + 1

    2 4 8 9 10 13 22
    0 1 2 3 4 5 6
    Selection sort

    I = 0; min = 6

    2 4 8 13 9 22 10
    0 1 2 3 4 5 6

    I = 1; min = 1

    2 4 8 13 9 22 10
    0 1 2 3 4 5 6

    I = 2; min =2

    2 4 8 13 9 22 10
    0 1 2 3 4 5 6

    I = 3; min = 4

    2 4 8 9 13 22 10
    0 1 2 3 4 5 6

    I = 4; min = 6

    2 4 8 9 10 22 13
    0 1 2 3 4 5 6

    I = 5; min = 6

    2 4 8 9 10 13 22
    0 1 2 3 4 5 6

    Insertion sort

    I=1
    4 10 8 13 9 22 2
    0 1 2 3 4 5 6

    I=2

    4 8 10 13 9 22 2
    0 1 2 3 4 5 6

    I=3

    4 8 10 13 9 22 2
    0 1 2 3 4 5 6

    I=4

    4 8 9 10 13 22 2
    0 1 2 3 4 5 6

    I=5

    4 8 9 10 13 22 2
    0 1 2 3 4 5 6

    I=6

    2 4 8 9 10 13 22
    0 1 2 3 4 5 6

    Bubble sort

    I = 0, i++;

    j = n – I -1, j++

    4 8 10 9 13 2 22
    0 1 2 3 4 5 6
    4 8 9 10 2 13 22
    0 1 2 3 4 5 6

    4 8 9 2 10 13 22
    0 1 2 3 4 5 6

    4 8 2 9 10 13 22
    0 1 2 3 4 5 6

    4 2 8 9 10 13 22
    0 1 2 3 4 5 6

    2 4 8 9 10 13 22
    0 1 2 3 4 5 6

    Quick sort
    8 6 10 5 4 11 3
    0 1 2 3 4 5 6

    QS(0, 6) x = 0
    2 4 8 9 10 22 13
    0 1 2 3 4 5 6

    QS(4,6) x = 5
    2 4 8 9 10 13 22
    0 1 2 3 4 5 6
    8 6 10 5 4 11 3 15 2
    0 1 2 3 4 5 6 7 8

    QS(0,8) x =

    2 6 5 4 3 8 10 15 11
    0 1 2 3 4 5 6 7 8

    QS(0,5) x = 0

    You might also like