Scribd Logo
Upload

Welcome to Scribd!

  • REQUIREMENT

    Uploaded by

    Johnnie Harrison
    9 views2 pages
    The document describes four sorting algorithms - insertion sort, radix/bucket sort, selection sort, and binary search - applied to a sample array of numbers. Insertion sort sorts the array in ascending order in multiple steps by inserting each element into the sorted portion. Radix/bucket sort sorts in descending order by distributing elements into buckets based on their digit values. Selection sort sorts in descending order by finding the largest element in each pass and swapping it into place. Binary search locates specific elements in a sorted array by repeatedly dividing the search space in half and comparing the middle element.

    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 document describes four sorting algorithms - insertion sort, radix/bucket sort, selection sort, and binary search - applied to a sample array of numbers. Insertion sort sorts the array in ascending order in multiple steps by inserting each element into the sorted portion. Radix/bucket sort sorts in descending order by distributing elements into buckets based on their digit values. Selection sort sorts in descending order by finding the largest element in each pass and swapping it into place. Binary search locates specific elements in a sorted array by repeatedly dividing the search space in half and comparing the middle element.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views2 pages

    REQUIREMENT

    Uploaded by

    Johnnie Harrison
    The document describes four sorting algorithms - insertion sort, radix/bucket sort, selection sort, and binary search - applied to a sample array of numbers. Insertion sort sorts the array in ascending order in multiple steps by inserting each element into the sorted portion. Radix/bucket sort sorts in descending order by distributing elements into buckets based on their digit values. Selection sort sorts in descending order by finding the largest element in each pass and swapping it into place. Binary search locates specific elements in a sorted array by repeatedly dividing the search space in half and comparing the middle element.

    Copyright:

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

    128, 47, 8521, 186, 774, 8975, 741, 121, 100, 500, 7789, 7410

    Insertion Sort – Ascending Order Magnitude


    step 1 = 128, 47, 8521, 186, 774, 8975, 741, 121, 100, 500, 7789, 7410
    step 2 = 47, 128, 8521, 186, 774, 8975, 741, 121, 100, 500, 7789, 7410
    step 3 = 47, 128, 8521, 186, 774, 8975, 741, 121, 100, 500, 7789, 7410
    step 4 = 47, 128, 186, 8521, 774, 8975, 741, 121, 100, 500, 7789, 7410
    step 5 = 47, 128, 186, 774, 8521, 8975, 741, 121, 100, 500, 7789, 7410
    step 6 = 47, 128, 186, 774, 8521, 8975, 741, 121, 100, 500, 7789, 7410
    step 7 = 47, 128, 186, 741, 774, 8521, 8975, 121, 100, 500, 7789, 7410
    step 8 = 47, 121, 128, 186, 741, 774, 8521, 8975, 100, 500, 7789, 7410
    step 9 = 47, 100, 121, 128, 186, 741, 774, 8521, 8975, 500, 7789, 7410
    step 10 = 47, 100, 121, 128, 186, 500, 741, 774, 8521, 8975, 7789, 7410
    step 11 = 47, 100, 121, 128, 186, 500, 741, 774, 7789, 8521, 8975, 7410
    step 12 = 47, 100, 121, 128, 186, 500, 741, 774, 7410, 7789, 8521, 8975

    Radix or Bucket Sort – Descending Order Magnitude


    0128, 0047, 8521, 0186, 0774, 8975, 0741, 0121, 0100, 0500, 7789, 7410
    Largest number = 8975
    pass 1 = 7789, 128, 47, 186, 8975, 774, 121, 741, 8521, 7410, 500, 100
    pass 2 = 7789, 186, 8975, 774, 741, 47, 121, 8521, 128, 7410, 500, 100
    pass 3 = 8975, 7789, 741, 774, 500, 8521, 7410, 100, 121, 186, 128, 47
    pass 4 = 8975, 8521, 7410, 7789, 500, 100, 121, 741, 774, 186, 47, 128

    Selection Sort – Descending Order Magnitude


    128, 47, 8521, 186, 774, 8975, 741, 121, 100, 500, 7789, 7410
    pass 1 = 8975, 47, 8521, 186, 774, 128, 741, 121, 100, 500, 7789, 7410
    pass 2 = 8975, 8521, 47, 186, 774, 128, 741, 121, 100, 500, 7789, 7410
    pass 3 = 8975, 8521, 7789, 186, 774, 128, 741, 121, 100, 500, 47, 7410
    pass 4 = 8975, 8521, 7789, 7410, 774, 128, 741, 121, 100, 500, 47, 186
    pass 5 = 8975, 8521, 7789, 7410, 774, 128, 741, 121, 100, 500, 47, 186
    pass 6 = 8975, 8521, 7789, 7410, 774, 741, 128, 121, 100, 500, 47, 186
    pass 7 = 8975, 8521, 7789, 7410, 774, 741, 500, 121, 100, 128, 47, 186
    pass 8 = 8975, 8521, 7789, 7410, 774, 741, 500, 186, 100, 128, 47, 121
    pass 9 = 8975, 8521, 7789, 7410, 774, 741, 500, 186, 128, 100, 47, 121
    pass 10 = 8975, 8521, 7789, 7410, 774, 741, 500, 186, 128, 121, 100, 47
    pass 11 = 8975, 8521, 7789, 7410, 774, 741, 500, 186, 128, 121, 100, 47
    pass 12 = 8975, 8521, 7789, 7410, 774, 741, 500, 186, 128, 121, 100, 47

    Binary Search – Locate no. 100


    a = [128, 47, 8521, 186, 774, 8975, 741, 121, 100, 500, 7789, 7410]
    - Sort into ascending order
    47, 100, 121, 128, 186, 500, 741, 774, 7410, 7789, 8521, 8975
    start = 0;
    end = 11
    comparison 1
    mid = (start + end) / 2
    = (0+11)/2
    =5
    100 < a[mid]
    100 < 500

    comparison 2
    47, 100, 121, 128, 186
    end = mid – 1 = 5 -1 = 4
    start = 0
    mid = (start + end) / 2 = (0 + 4) / 2 = 2
    100 < a[mid]
    100 < 121

    comparison 3
    47, 100
    end = mid – 1 = 2 -1 = 1
    start = 0
    mid = (start + end) / 2 = (0 + 1) / 2 = 1
    100 = a[mid]
    100 = 100

    therefore, three (3) comparisons were needed to locate the number 100.

    Binary Search – Locate no. 250


    a = [128, 47, 8521, 186, 774, 8975, 741, 121, 100, 500, 7789, 7410]
    - Sort into ascending order
    47, 100, 121, 128, 186, 500, 741, 774, 7410, 7789, 8521, 8975
    start = 0;
    end = 11
    comparison 1
    mid = (start + end) / 2
    = (0+11)/2
    =5
    250 < a[mid]
    250 < 500

    comparison 2
    47, 100, 121, 128, 186
    end = mid – 1 = 5 -1 = 4
    start = 0
    mid = (start + end) / 2 = (0 + 4) / 2 = 2
    250 > a[mid]
    250 > 121

    therefore, the number 250 cannot be found in the list

    You might also like