Write programs for Bubble Sort, Quick sort
Answer Posted / rakesh
/* Write C programs that implement the following sorting
methods to sort
a given list of integers in ascending order: i) Bubble
sort */
#include <stdio.h>
#define MAX 10
void swapList(int *m,int *n)
{
int temp;
temp = *m;
*m = *n;
*n = temp;
}
// Function for Bubble Sort
void bub_sort(int list[], int n)
{
int i,j;
for(i=0;i<(n-1);i++)
for(j=0;j<(n-(i+1));j++)
if(list[j] > list[j+1])
swapList(&list[j],&list[j+1]);
}
void readlist(int list[],int n)
{
int j;
printf("\nEnter the elements: \n");
for(j=0;j<n;j++)
scanf("%d",&list[j]);
}
// Showing the contents of the list
void printlist(int list[],int n)
{
int j;
for(j=0;j<n;j++)
printf("%d\t",list[j]);
}
void main()
{
int list[MAX], num;
clrscr();
printf("\n\n\n***** Enter the number of elements
[Maximum 10] *****\n");
scanf("%d",&num);
readlist(list,num);
printf("\n\nElements in the list before sorting are:\n");
printlist(list,num);
bub_sort(list,num);
printf("\n\nElements in the list after sorting are:\n");
printlist(list,num);
getch();
}
| Is This Answer Correct ? | 15 Yes | 11 No |
Post New Answer View All Answers
How to inverting a function in sort and searching?
Does linked list allow duplicates?
What are the major data structures used in the rdbms?
How do you find the complexity of a bubble sort?
What is link list in data structure?
When is a binary search algorithm best applied?
How does a treemap sort?
Which is the slowest sorting algorithm?
What is the purpose of sorting?
What’s the difference between enumeration and iterator interfaces?
What is difference between hashset and treeset?
How do you sort pseudocode?
What happens when arraylist is full?
What is shell sort in data structure?
What are data and data types?