ALGOTITHM STEP 1: Start the program. STEP 2: Read the value of n. STEP 3: Set for loop to read the elements of array for( i = 0; i < n; i++ ). STEP 4: Call the function bubblesort ( a , n ). STEP 5: Print the sorted array a. STEP 6: Stop the program. FUNCTION BUBBBLESORT ( int *b [], int n ) STEP 1: Declare the local variable. STEP 2: Set a for loop for( i = 0; i < n; i++ ) STEP 3: Nest another for loop for( j = 1; j < n; j++ ) STEP 4: Check the condition b[i] > b[j] STEP 5: If so swap the two values using temporary y variable t as t = a[i] b[i] = b[j] b[j] = t STEP 6: Else go back to step3. SAMPLE PROGRAM: #include<stdio.h> #include<conio.h> void bubblesort( int *[], int); void main() { int i, n, a[100]; clrscr(); printf( " \n Enter the number of elements: " ); scanf( " %d ", &n ); printf( " \n Enter the array elements " ); for( i = 0; i < n; i++) scanf( " %d ...
All HR and Technical interview questions with answers for freshers and experienced professional. It helps job seekers who are about to attend interviews.