Write a program that implements Bubble Sort Method to sort a given list of integers in ascending order.
#include<stdio.h>
bubblesort(int a[],int n)
{
int temp,p,c;
for(p=1;p<=n-1;p++)
{
for(c=1;c<=n-p;c++)
{
if(a[c]>a[c+1])
{
temp=a[c];
a[c]=a[c+1];
a[c+1]=temp;
}
}
}
}
int main()
{
int a[5],n,i;
printf("enter n value");
scanf("%d",&n);
printf("enter %d elements into array",n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
bubblesort(a,n);
printf("after sauting elements are");
for(i=1;i<=n;i++)
printf("%d\t",a[i]);
return 1;
}
1) Write a C program that uses functions to perform the following on Singly Linked List: i) Creation ii) Insertion iii) Deletion iv) TraversalView Solution
2) Write a program that uses functions to perform the following operations on Doubly Linked List.: i) Creation ii) Insertion iii) Deletion iv) TraversalView Solution
3) Write a program that uses functions to perform the following operations on Circular Linked List.: i) Creation ii) Insertion iii) Deletion iv) TraversalView Solution
4) Write a program that implement Stack (its operations) using ArraysView Solution
5) Write a program that implement Stack (its operations) using PointersView Solution
6) Write a program that implement Queue (its operations) using ArraysView Solution
7) Write a program that implement Queue (its operations) using PointersView Solution
8) Write a program that implements Bubble Sort Method to sort a given list of integers in ascending order.View Solution
9) Write a program that implements Selection Sort Method to sort a given list of integers in ascending order.View Solution
10) Write a program that implements Insertion Sort Method to sort a given list of integers in ascending order.View Solution
11) Write a program that use both recursive and non recursive functions to perform Linear search operations for a Key value in a given list of integers.View Solution
12) Write a program that use both recursive and non recursive functions to perform Binary search operations for a Key value in a given list of integers.View Solution
13) Write a program to implement the tree traversal methods.View Solution
14) Write a program to implement Depth First Search (DFS) graph traversal methods.View Solution
15) Write a program to implement Breadth First Search (BFS) graph traversal methods.View Solution