How recursive bubble sort work

 

                                            Recursive Bubble Sort

  1. Base Case: If array size is 1, return.
  2. Do One Pass of normal Bubble Sort. This pass fixes last element of current subarray.
  3. Recur for all elements except last of current subarray.

Example:

Index=     0 1  2 3 4 5 6 7

 

100                         

90

80

70

60

50

40

30

 Array []=

Suppose we want to sort the above in the increasing order by the recursive bubble sort.

Make a get grater which will return the grater of the array.

Compare the first and last element of the array if the first is greater than last the swap with each other.

And again call the sort function and decrement the array size by 1;

1)

30                    

90

80

70

60

50

40

100

 

 

 

2)

30                       

40

80

70

60

50

90

100

 

The 30 is less the 90 the get grater will return the 90 as a maximum and compare it with the second last and swap.

3)

      This will repeat until the array become sort

 

 

At last the sorted array 

30                       

40

50

60

70

80

90

100

 

 

Comments

Post a Comment

if you have any confusion then ask hear.

Popular posts from this blog

simple calculator apps project in android studio

Image
                                         calculator apps                                                                XML CODE <? xml version ="1.0" encoding ="utf-8" ?> <LinearLayout xmlns: android ="http://schemas.android.com/apk/res/android"     xmlns: app ="http://schemas.android.com/apk/res-auto"     xmlns: tools ="http://schemas.android.com/tools"     android :layout_width ="match_parent"     android :layout_height ="match_parent"     android :orientation ="vertical"     android :padding ="16dp"     tools :context =".MainActivity" >     <TextView         android :id ="@+id/tvResult"         android :layout_width ="375dp"         android :layout_height ="137dp"         android :b...
Read more

Arrays in C Programming Language

Image
Array is a data structure in C++, which stores a fixed size sequential collection of elements of the same type. An array is used to store a collection of data. It is often useful to think of an array as a collection of variables of the same type. Instead of declaring individual variables, such as number0, number1, ..., and number99, you declare one array variable such as numbers and use numbers[0], numbers[1], and ..., numbers[99] to represent individual variables. A specific element in an array is accessed by an index. All arrays consist of contiguous memory locations. The lowest address corresponds to the first element and the highest address to the last element. Declaring an array in C, the programmer specifies the type of the elements and the number of elements required by an array as follows:   type array-Name [ array-Size ]; This is called a single-dimension array. The array-Size must be an integer constant greater than zero and type can be any valid C data type...
Read more

Pointers in C

Image
Pointer is a variable that points to or references a memory location in which data is stored. This means that a pointer holds the memory address of another variable. Put another way, the pointer does not hold a value in the traditional sense; instead, it holds the address of another variable. A pointer "points to" that other variable by holding a copy of its address. Because a pointer holds an address rather than a value, it has two parts. The pointer itself holds the address and that address points to a value. Pointer declaration is shown below. You start by specifying the type of data stored in the location identified by the pointer. The asterisk tells the compiler that you are creating a pointer variable. Finally you give the name of the variable. Data-type *variable-name Such a variable is called a pointer variable. When we define a pointer variable we do so by preceding its name with an asterisk. In C, we also give our pointer a type which, in this case, refe...
Read more