Don of web The tech underworld

Bubble sort is a sorting technique where each two adjacent numbers are compared and the process is repeated until the whole list is sorted. This is less efficient but stable Program: #include int main() { int arr[100],i,j,n,temp; printf("Enter no. of terms\n"); scanf("%d",&n); printf("Enter the elements\n"); for(i=0;iarr[j+1]) { temp=arr[j]; arr[j]=arr[j+1]; arr[j+1]=temp; } } printf("Sorted elements are\n"); for(i=0;i Read More »

Well before starting, let’s look at the basic defention and how we find mean, median and mode. Both these are 3 variables to find the average value or an approximate value of a list, but yet they have different values as they are based on 3 different concepts Concepts of mean, median and mode What is mean ?  Mean is ... Read More »