Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Algorithms

    Uploaded by

    Mythes Jica
    Sorting algorithms rearrange elements in a list into a specific order. The most common orders are numerical and alphabetical. Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are out of order until the list is fully sorted. It does this by making multiple passes through the list and comparing and swapping adjacent elements on each pass if they are in the wrong order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Algorithms

    Uploaded by

    Mythes Jica
    13 views3 pages
    Sorting algorithms rearrange elements in a list into a specific order. The most common orders are numerical and alphabetical. Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are out of order until the list is fully sorted. It does this by making multiple passes through the list and comparing and swapping adjacent elements on each pass if they are in the wrong order.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Sorting algorithms rearrange elements in a list into a specific order. The most common orders are numerical and alphabetical. Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are out of order until the list is fully sorted. It does this by making multiple passes through the list and comparing and swapping adjacent elements on each pass if they are in the wrong order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    13 views3 pages

    Algorithms

    Uploaded by

    Mythes Jica
    Sorting algorithms rearrange elements in a list into a specific order. The most common orders are numerical and alphabetical. Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are out of order until the list is fully sorted. It does this by making multiple passes through the list and comparing and swapping adjacent elements on each pass if they are in the wrong order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 3

    Sorting Algorithms

    In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain
    order. The most frequently used orders are numerical order and lexicographical order. Efficient
    sorting is important for optimizing the efficiency of other algorithms which require input data to
    be in sorted lists.
    Sorting Algorithm is used to rearrange a given array or list elements according to a comparison
    operator on the elements. The comparison operator is used to decide the new order of element in
    the respective data structure.
    “Sort” – the act of separating things and putting them in a particular order : the act of sorting
    things
    “Algorithms” – a process or set of rules to be followed in calculations or other problem-solving
    operations, especially by a computer.
    Bubble Sort
    Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent
    elements if they are in wrong order.
    Example:
    First Pass:
    ( 5 1 4 2 8 ) –> ( 1 5 4 2 8 ), Here, algorithm compares the first two elements, and swaps since 5 > 1.
    ( 1 5 4 2 8 ) –>  ( 1 4 5 2 8 ), Swap since 5 > 4
    ( 1 4 5 2 8 ) –>  ( 1 4 2 5 8 ), Swap since 5 > 2
    ( 1 4 2 5 8 ) –> ( 1 4 2 5 8 ), Now, since these elements are already in order (8 > 5), algorithm does not
    swap them.

    Second Pass:
    ( 1 4 2 5 8 ) –> ( 1 4 2 5 8 )
    ( 1 4 2 5 8 ) –> ( 1 2 4 5 8 ), Swap since 4 > 2
    ( 1 2 4 5 8 ) –> ( 1 2 4 5 8 )
    ( 1 2 4 5 8 ) –>  ( 1 2 4 5 8 )

    Now, the array is already sorted, but our algorithm does not know if it is completed. The
    algorithm needs one whole pass without any swap to know it is sorted.
    Third Pass:
    ( 1 2 4 5 8 ) –> ( 1 2 4 5 8 )
    ( 1 2 4 5 8 ) –> ( 1 2 4 5 8 )
    ( 1 2 4 5 8 ) –> ( 1 2 4 5 8 )
    ( 1 2 4 5 8 ) –> ( 1 2 4 5 8 )

    // C program for implementation of Bubble sort


    #include <stdio.h>
    void swap(int *xp, int *yp)
    {
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
    }
    // A function to implement bubble sort
    void bubbleSort(int arr[], int n)
    {
    int i, j;
    for (i = 0; i < n-1; i++)

    // Last i elements are already in place


    for (j = 0; j < n-i-1; j++)
    if (arr[j] > arr[j+1])
    swap(&arr[j], &arr[j+1]);
    }
    /* Function to print an array */
    void printArray(int arr[], int size)
    {
    int i;
    for (i=0; i < size; i++)
    printf("%d ", arr[i]);
    printf("n");
    }
    // Driver program to test above functions
    int main()
    {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    bubbleSort(arr, n);
    printf("Sorted array: \n");
    printArray(arr, n);
    return 0;
    }

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy