Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • Begin Declare Array List: Size of The List N

    Загружено:

    divyeshbhayani
    9 просмотров1 страница
    The document describes a selection sort algorithm with 5 steps: 1) Set the initial minimum value index to 0, 2) Search the list to find the minimum element, 3) Swap the minimum element with the element at the initial index, 4) Increment the minimum index to the next element, 5) Repeat steps 2 through 4 until the list is fully sorted. Pseudocode is provided to initialize an array list, iterate through with an inner loop to find the minimum value index and swap if needed, and repeat for each element until sorting is complete.

    Исходное описание:

    selection sort alogrithm and code

    Оригинальное название

    Selection Sort

    Авторское право

    © © All Rights Reserved

    Доступные форматы

    DOCX, PDF, TXT или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    The document describes a selection sort algorithm with 5 steps: 1) Set the initial minimum value index to 0, 2) Search the list to find the minimum element, 3) Swap the minimum element with the element at the initial index, 4) Increment the minimum index to the next element, 5) Repeat steps 2 through 4 until the list is fully sorted. Pseudocode is provided to initialize an array list, iterate through with an inner loop to find the minimum value index and swap if needed, and repeat for each element until sorting is complete.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате DOCX, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    9 просмотров1 страница

    Begin Declare Array List: Size of The List N

    Загружено:

    divyeshbhayani
    The document describes a selection sort algorithm with 5 steps: 1) Set the initial minimum value index to 0, 2) Search the list to find the minimum element, 3) Swap the minimum element with the element at the initial index, 4) Increment the minimum index to the next element, 5) Repeat steps 2 through 4 until the list is fully sorted. Pseudocode is provided to initialize an array list, iterate through with an inner loop to find the minimum value index and swap if needed, and repeat for each element until sorting is complete.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате DOCX, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 1

    Step

    Step
    Step
    Step
    Step

    1
    2
    3
    4
    5

    Set MIN to location 0


    Search the minimum element in the list
    Swap with value at location MIN
    Increment MIN to point to next element
    Repeat until list is sorted

    Begin
    Declare Array List
    Size of the list n
    for i = 0 to n
    min = i
    for j = i+1 to n
    if list[j] < list[min] then
    min = j;
    end if
    end for
    /* swap the minimum element with the current element*/
    if indexMin != i then
    swap list[min] and list[i]
    end if
    end for
    end procedure

    Вам также может понравиться