swethareddy18 / Design-and-analysis-algorithm

0 stars 0 forks source link

Bubble sort #20

Open swethareddy18 opened 1 year ago

swethareddy18 commented 1 year ago

include

int main() { int array[100], n, i, j, swap; printf("Enter number of elements="); scanf("%d", &n); printf("Enter %d Numbers:\n", n); for(i = 0; i < n; i++) scanf("%d", &array[i]); for(i = 0 ; i < n - 1; i++) { for(j = 0 ; j < n-i-1; j++) { if(array[j] > array[j+1]) { swap=array[j]; array[j]=array[j+1]; array[j+1]=swap; } } } printf("Sorted Array:\n"); for(i = 0; i < n; i++) printf("%d\n", array[i]); return 0; }