Scribd Logo
Upload

Welcome to Scribd!

  • Perform Selection Sort: Lab No.1

    Uploaded by

    Prïñčé Äl Ŝåmád
    17 views3 pages
    The document describes selection sort, an algorithm that sorts an array by repeatedly finding the minimum element from the unsorted portion and moving it to the sorted portion. It does this by: 1) Finding the index of the minimum element in the unsorted portion. 2) Swapping the minimum element with the first element of the unsorted portion. 3) Repeating for the remaining unsorted elements. The time complexity of selection sort is O(n^2) in both average and worst cases, requiring no additional memory. It performs n-1 exchanges and n(n-1)/2 comparisons total. The document then asks to write a program implementing selection sort on an array of 10 randomly generated elements.

    Original Description:

    123

    Original Title

    Lab 1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes selection sort, an algorithm that sorts an array by repeatedly finding the minimum element from the unsorted portion and moving it to the sorted portion. It does this by: 1) Finding the index of the minimum element in the unsorted portion. 2) Swapping the minimum element with the first element of the unsorted portion. 3) Repeating for the remaining unsorted elements. The time complexity of selection sort is O(n^2) in both average and worst cases, requiring no additional memory. It performs n-1 exchanges and n(n-1)/2 comparisons total. The document then asks to write a program implementing selection sort on an array of 10 randomly generated elements.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    17 views3 pages

    Perform Selection Sort: Lab No.1

    Uploaded by

    Prïñčé Äl Ŝåmád
    The document describes selection sort, an algorithm that sorts an array by repeatedly finding the minimum element from the unsorted portion and moving it to the sorted portion. It does this by: 1) Finding the index of the minimum element in the unsorted portion. 2) Swapping the minimum element with the first element of the unsorted portion. 3) Repeating for the remaining unsorted elements. The time complexity of selection sort is O(n^2) in both average and worst cases, requiring no additional memory. It performs n-1 exchanges and n(n-1)/2 comparisons total. The document then asks to write a program implementing selection sort on an array of 10 randomly generated elements.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    Algorithmic Analysis & Design (CS-401)

    Perform selection sort

    Lab No.1

    Objectives Describe basic concept of selection sort. Implement selection sort.

    Algorithmic Analysis & Design (CS-401)

    Selection Sort
    This type of sorting is called "Selection Sort" because it works by repeatedly element. It works as follows: first find the smallest in the array and exchange it with the element in the first position, then find the second smallest element and exchange it with the element in the second position, and continue in this way until the entire array is sorted. SELECTION_SORT (A) Input: An array A[1..n] of n elements. Output: A[1..n] sorted in nondecreasing order. 1. for i 1 to n - 1 2. k i 3. for j i + 1 to n {Find the i th smallest element.} 4. if A[j] < A[k] then k j 5. end for 6. if k i then interchange A[i] and A[k] 7. end for The worst case occurs if the array is already sorted in descending order. Nonetheless, the time require by selection sort algorithm is not very sensitive to the original order of the array to be sorted: the test "if A[j] < min x" is executed exactly the same number of times in every case. The variation in time is only due to the number of times the "then" part (i.e., min j j; min x A[j] of this test are executed. The Selection sort spends most of its time trying to find the minimum element in the "unsorted" part of the array. It clearly shows the similarity between Selection sort and Bubble sort. Bubble sort "selects" the maximum remaining elements at each stage, but wastes some effort imparting some order to "unsorted" part of the array. Selection sort is quadratic in both the worst and the average case, and requires no extra memory. For each i from 1 to n - 1, there is one exchange and n - i comparisons, so there is a total of n -1exchanges and (n -1) + (n -2) + . . . + 2 + 1 = n(n -1)/2 comparisons. These observations hold no matter what the input data is. In the worst case, this could be quadratic, but in the average case, this quantity is O(n log n). It implies that the running time of Selection sort is quite insensitive to the input.

    Algorithmic Analysis & Design (CS-401)

    Task 1 Write a program that can fill an array of 10 elements randomly then sort it by using selection sort.

    You might also like