KENDRIYA VIDYALAYA
Bubble sort compares a[i] with a[i+1] for all i=0..n-2, if a[i] and a[i+1] are not in ascending order then exchange a[i] with a[i+1] immediately. After each iteration all elements which are not at their proper position move at least one position towards their right place in the array. ................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.