Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Selection Sort

    Uploaded by

    Nitin Yadav
    Selection sort works by repeatedly finding the minimum element in the unsorted portion of the array and swapping it into the sorted position. It does this in multiple rounds or passes through the array until the array is fully sorted. Each round, it identifies the smallest element and places it in the next slot in the sorted portion of the array. This continues until all elements are sorted.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Selection Sort

    Uploaded by

    Nitin Yadav
    23 views10 pages
    Selection sort works by repeatedly finding the minimum element in the unsorted portion of the array and swapping it into the sorted position. It does this in multiple rounds or passes through the array until the array is fully sorted. Each round, it identifies the smallest element and places it in the next slot in the sorted portion of the array. This continues until all elements are sorted.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Selection sort works by repeatedly finding the minimum element in the unsorted portion of the array and swapping it into the sorted position. It does this in multiple rounds or passes through the array until the array is fully sorted. Each round, it identifies the smallest element and places it in the next slot in the sorted portion of the array. This continues until all elements are sorted.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    23 views10 pages

    Selection Sort

    Uploaded by

    Nitin Yadav
    Selection sort works by repeatedly finding the minimum element in the unsorted portion of the array and swapping it into the sorted position. It does this in multiple rounds or passes through the array until the array is fully sorted. Each round, it identifies the smallest element and places it in the next slot in the sorted portion of the array. This continues until all elements are sorted.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 10

    Setein Sort

    I 7 9 2 3 0
    arr 1) =

    soot
    1 2 3 7 9
    sorted
    woop i
    ↳ sorted

    what →
    ?
    S
    what -
    ? sgt

    ↳ different Rounds
    -
    / passes
    ↳ smallest element
    laake
    ,
    uskio right
    Khote
    g-agahhaipr place

    o l L 3 4
    1)
    ¥zs|12|22|
    → an →

    Rowdy : -
    64 ÉÉ%±
    ↳
    swap

    11
    25%2 22 64
    Round 2: -

    .= 25%52
    swap

    11 12 by

    Royals : -

    11 12 22 25 64

    Rowd
    riÉ .
    xxii-x-E.EE
    I ±
    ✗ ✗
    I :#
    ✗ ✗ ✗
    1 Ex
    ✗ ✗ ✗ ✗
    I ± =9oAed=
    "

    ¥±
    "

    ↳ ÷;;/
    i¥i
    ✗

    ×÷☐ "
    ← a-

    ÷
    ?⃝
    FEY 8 4 10

    c-
    2 6 8 4 10

    2 4 89 10

    sorted 2.468102g
    u÷ ,

    I 3-2 4

    softy 1232€
    →
    min
    Index

    ¥É÷ ¥←Érwp b< a

    cd-b-mintndcx-f-%FF.IE
    b a

    µ③¥÷÷•?
    i

    ↳ 3-
    <
    ✗
    3-569
    ror @ - En D)
    -

    space aerpkat

    ↳ ↳ 04 )
    for ( ite → Cn )

    Time henpkaity n size


    =

    ⑨ bE 4 x-D

    EM 3 Cn -

    Y
    a
    b-
    l l

    t
    ,

    1
    I

    1 2

    Lt 21-3 -
    -

    -
    Ch v1
    -
    t.cn -

    1)

    nC II
    =
    =

    T-c→o(n#
    T C -

    Best case →
    already sorta →
    0(n¥

    is-i -vse-EI-wa.li#1:I-@
    Worst case → 0 ( n

    "
    =
    Hm
    In
    flow-c-haitl.SE#-s
    T -
    C
    ,_

    Use → I ?
    -

    care
    d
    Code → what

    4
    Dry on selection sort ?
    Ñié
    I
    ✓
    -
    -

    i -0 ↳ 1 < 7 → TRUE
    miTd✗O 6
    ↳ update mintndex

    L) minTn③
    ↳ 4<1 → Fdn →
    ignore

    ↳ 3<1 → mm

    ↳ get → fake -

    e- =0 min Index =L
    ,

    ↳
    ililu.IE#
    e-=
    ↳
    I

    mñInde×=1 4<7 → TRUE

    ↳ minTude1
    e-=L ,
    min Index
    3- -

    ↳ 3<4 → TRUE

    Ts
    '

    mi
    =-3
    ↳
    9<3-1 the → Ignore
    t.i mil#e-=2mT- =2b7a-sfdnlsgau-febi i-
    ↳gotta
    ④

    1347*7 sorted

    You might also like