Scribd Logo
Upload

Welcome to Scribd!

  • 115 views

    Bubble Sort

    Uploaded by

    Vikram Singh
    Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are in the wrong order. It has a worst-case time complexity of O(n2) making it inefficient for large data sets. Bubble sort is easy to implement and requires no additional space, but it is a slow sorting algorithm compared to others.

    Copyright:

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

    Bubble Sort

    Uploaded by

    Vikram Singh
    115 views11 pages
    Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are in the wrong order. It has a worst-case time complexity of O(n2) making it inefficient for large data sets. Bubble sort is easy to implement and requires no additional space, but it is a slow sorting algorithm compared to others.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are in the wrong order. It has a worst-case time complexity of O(n2) making it inefficient for large data sets. Bubble sort is easy to implement and requires no additional space, but it is a slow sorting algorithm compared to others.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    115 views11 pages

    Bubble Sort

    Uploaded by

    Vikram Singh
    Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements that are in the wrong order. It has a worst-case time complexity of O(n2) making it inefficient for large data sets. Bubble sort is easy to implement and requires no additional space, but it is a slow sorting algorithm compared to others.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 11

    Bubble Sort

    Bubble Sort is the simplest sorting algorithm that works by repeatedly


    swapping the adjacent elements if they are in the wrong order. This
    algorithm is not suitable for large data sets as its average and worst-
    case time complexity is quite high.

    Due to its simplicity, bubble sort is often used to introduce the concept
    of a sorting algorithm. In computer graphics, it is popular for its
    capability to detect a tiny error (like a swap of just two elements) in
    almost-sorted arrays and fix it with just linear complexity (2n).
    Bubble Sort Algorithm:
    In this algorithm:

    • Traverse from left and compare adjacent elements and the higher one
    is placed at right side.

    • In this way, the largest element is moved to the rightmost end at first.

    • This process is then continued to find the second largest and place it
    and so on until the data is sorted.
    Input: arr[] = {6, 3, 0, 5}
    • First Pass:
    • The largest element is placed in its correct position, i.e., the end of the
    array.
    • Time Complexity Analysis of Bubble Sort:
    • Best Case: The best case occurs when the array is already sorted. So
    the number of comparisons required is N-1 and the number of swaps
    required = 0. Hence the best case complexity is O(N).
    • Worst Case: The worst-case condition for bubble sort occurs when
    elements of the array are arranged in decreasing order.
    In the worst case, the total number of iterations or passes required to
    sort a given array is (N-1). where ‘N’ is the number of elements
    present in the array.
    • Average Case : The number of comparisons is constant in Bubble Sort.
    So in average case, there are O(N2) comparisons. This is because
    irrespective of the arrangement of elements, the number of
    comparisons C(N) is same.
    • Auxiliary Space: O(1) as no additional space is used.
    • Advantages of Bubble Sort:
    • Bubble sort is easy to understand and implement.
    • It does not require any additional memory space.
    • It is a stable sorting algorithm, meaning that elements with the same
    key value maintain their relative order in the sorted output.
    • Disadvantages of Bubble Sort:

    • Bubble sort has a time complexity of O(N2) which makes it very slow
    for large data sets.
    • Bubble sort is a comparison-based sorting algorithm, which means
    that it requires a comparison operator to determine the relative order
    of elements in the input data set. It can limit the efficiency of the
    algorithm in certain cases.
    void swap(int* xp, int* yp) {
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
    }
    void bubbleSort(int arr[], int n) {
    int i, j;
    bool swapped;
    for (i = 0; i < n - 1; i++) {
    swapped = false;
    for (j = 0; j < n - i - 1; j++) {
    if (arr[j] > arr[j + 1]) {
    swap(&arr[j], &arr[j + 1]);
    swapped = true;
    }
    }
    if (swapped == false)
    break;
    }
    }
    void printArray(int arr[], int size) {
    int i;
    for (i = 0; i < size; i++)
    printf("%d ", arr[i]);
    }
    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