Scribd Logo
Upload

Welcome to Scribd!

  • SelectionSort

    Uploaded by

    Sai Karthik
    8 views34 pages
    The document is a lecture on selection sort presented by Arvind Kumar. It contains step-by-step animations and explanations of how selection sort works by finding the minimum value in an array and swapping it with the first element, then repeating for the remaining elements. The key steps are comparison to find the minimum, data movement to swap elements, and sorting the array. It concludes by presenting the selection sort algorithm and comparing time complexities of different sorting algorithms.

    Original Description:

    Original Title

    5. SelectionSort

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is a lecture on selection sort presented by Arvind Kumar. It contains step-by-step animations and explanations of how selection sort works by finding the minimum value in an array and swapping it with the first element, then repeating for the remaining elements. The key steps are comparison to find the minimum, data movement to swap elements, and sorting the array. It concludes by presenting the selection sort algorithm and comparing time complexities of different sorting algorithms.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    8 views34 pages

    SelectionSort

    Uploaded by

    Sai Karthik
    The document is a lecture on selection sort presented by Arvind Kumar. It contains step-by-step animations and explanations of how selection sort works by finding the minimum value in an array and swapping it with the first element, then repeating for the remaining elements. The key steps are comparison to find the minimum, data movement to swap elements, and sorting the array. It concludes by presenting the selection sort algorithm and comparing time complexities of different sorting algorithms.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 34

    Data Structures

    Lecture: Selection Sort


    By
    Arvind Kumar
    Asst. Professor

    Lovely Professional University, Punjab


    Selection Sort

    5 1 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    5 1 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    5 1 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    5 1 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    5 1 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    5 1 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    5 1 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    5 1 3 4 6 2

    Min

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 5 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 5 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 5 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 5 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 5 3 4 6 2

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 5 3 4 6 2

    Min

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Min

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Min

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 6 5

    Min

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 5 6

    Comparison

    Data Movement

    Sorted
    Selection Sort

    1 2 3 4 5 6
    DONE!
    Comparison

    Data Movement

    Sorted
    Selection Sort
    Selection_Sort (A, n)

    1. Set j = 0.
    2. Repeat While j < n – 1:
    3. Set Min = j and i = j+1.
    4. Repeat step 5 while i < n:
    5. if(a[i] < a[Min]), then:
    Min = i.
    [End of step 4 loop.]
    6. if (Min != j), then:
    7. swap (a[j], a[Min]).
    8.[End of step 2 loop.]
    9.Return.
    Comparison Table of Sorting
    Best Average Worst
    Case Case Case

    Bubble Sort O(n) O(n2) O(n2)


    Insertion Sort O(n) O(n2) O(n2)
    Selection Sort O(n2) O(n2) O(n2)
    Merge Sort O(n log n) O(n log n) O(n log n)
    Quick Sort O(n log n) O(n log n) O(n2)
    Heap Sort O(n log n) O(n log n) O(n log n)
    Questions?

    You might also like