Scribd Logo
Upload

Welcome to Scribd!

  • Selection Sort

    Uploaded by

    sαєєd αнмєd кαLωαr
    8 views1 page
    The selection sort algorithm finds the minimum value in a list and swaps it with the first element, then finds the next minimum value and swaps it with the second element, continuing until the list is fully sorted. It does this by calling a MIN procedure to find the minimum element in a portion of the list and its index, then swapping that minimum element into its sorted position at the start of the list portion.

    Original Description:

    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 selection sort algorithm finds the minimum value in a list and swaps it with the first element, then finds the next minimum value and swaps it with the second element, continuing until the list is fully sorted. It does this by calling a MIN procedure to find the minimum element in a portion of the list and its index, then swapping that minimum element into its sorted position at the start of the list portion.

    Copyright:

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

    Selection Sort

    Uploaded by

    sαєєd αнмєd кαLωαr
    The selection sort algorithm finds the minimum value in a list and swaps it with the first element, then finds the next minimum value and swaps it with the second element, continuing until the list is fully sorted. It does this by calling a MIN procedure to find the minimum element in a portion of the list and its index, then swapping that minimum element into its sorted position at the start of the list portion.

    Copyright:

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

    SELECTION SORT ALGORITHM

    Procedure: MIN(A, K, N, LOC)

    1. Set MIN = A[K] and LOC = K

    2. Repeat for J = k + 1, K + 2, …….N

    If MIN > A[J], then Set MIN = A[J] and LOC = J

    [End of Loop]

    3. Return

    Algorithm:

    1. Repeat Steps 2 and 3 for K = 1, 2, ….., N-1


    2. Call MIN(A, K, N, LOC)
    3. [Interchange A[K] and A[LOC].]
    Set TEMP = A[K], A[K] = A[LOC] and A[LOC] = TEMP
    [End of Step 1 Loop]
    4. Exit

    You might also like