Question

The memory available for
storage is less, in this case if you
want to sort the data which is
the better approach amongst
the following
*
O Heap Sort
O Merge Sort
☆
O Bubble sort
O All of the above​

Answer 1

Answer:

Bubble sort is a simple sorting algorithm. It works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. Because it only uses comparisons to operate on elements, it is a comparison sort.

Step-by-Step Example

Assume we have an array "5 1 4 2 8" and we want to sort the array from the lowest number to the greatest number using bubble sort.

Pseudocode Implementation

procedure bubbleSort( A : list of sortable items ) defined as:

  do

    swapped := false

    for each i in 0 to length(A) - 1 inclusive do:

      if A[i] > A[i+1] then

        swap( A[i], A[i+1] )

        swapped := true

      end if

    end for

  while swapped

end procedure

An Improved Alternative Implementation

procedure bubbleSort( A : list of sortable items ) defined as:

  n := length( A )

  do

    swapped := false

    for each i in 0 to n - 1 inclusive do:

      if A[ i ] > A[ i + 1 ] then

        swap( A[ i ], A[ i + 1 ] )

        swapped := true

      end if

    end for

    n := n - 1

  while swapped

end procedure

Here, instead of doing n(n-1) comparisons, we reduce it to (n-1) + (n-2) + ... + 1 = n(n-1)/2 comparisons.

Performance

Worst case performance: O(n2)

Best case performance: O(n)

Average case performance: O(n2)

Worst case space complexity: O(n) total, O(1) auxiliary

Bubble sort is not a practical sorting algorithm when n is large.

Explanation:

HOPE MY ANSWERS HELPS U IF U HAD PLZZZ BRAINLIST ME AND FOLLOW ME