week-20x
Download as DOC, PDF0 likes311 views
This C program implements quicksort and bubble sort algorithms to sort lists of integers in ascending order. It includes functions to read in and print lists of integers, as well as functions for the sorting algorithms. Quicksort uses partitioning and recursion to sort the list, while bubble sort uses nested for loops to compare and swap adjacent elements.
![/* Write C program that implement the following sorting methods
to sort a given list of integers in ascending order: ii) Quick sort */
#include <stdio.h>
#define MAX 10
void swap(int *m,int *n)
{
int temp;
temp = *m;
*m = *n;
*n = temp;
}
int get_key_position(int x,int y )
{
return((x+y) /2);
}
// Function for Quick Sort
void quicksort(int list[],int m,int n)
{
int key,i,j,k;
if( m < n)
{](https://image.slidesharecdn.com/6846236/85/week-20x-1-320.jpg)
![k = get_key_position(m,n);
swap(&list[m],&list[k]);
key = list[m];
i = m+1;
j = n;
while(i <= j)
{
while((i <= n) && (list[i] <= key))
i++;
while((j >= m) && (list[j] > key))
j--;
if( i < j)
swap(&list[i],&list[j]);
}
swap(&list[m],&list[j]);
quicksort(list,m,j-1);
quicksort(list,j+1,n);
}
}
// Function to read the data
void read_data(int list[],int n)
{
int j;](https://image.slidesharecdn.com/6846236/85/week-20x-2-320.jpg)
![printf("nnEnter the elements:n");
for(j=0;j<n;j++)
scanf("%d",&list[j]);
}
// Function to print the data
void print_data(int list[],int n)
{
int j;
for(j=0;j<n;j++)
printf("%dt",list[j]);
}
void main()
{
int list[MAX], num;
clrscr();
printf("n***** Enter the number of elements Maximum [10] *****n");
scanf("%d",&num);
read_data(list,num);
printf("nnElements in the list before sorting are:n");
print_data(list,num);
quicksort(list,0,num-1);
printf("nnElements in the list after sorting are:n");](https://image.slidesharecdn.com/6846236/85/week-20x-3-320.jpg)
![print_data(list,num);
getch();
}
/* 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])](https://image.slidesharecdn.com/6846236/85/week-20x-4-320.jpg)
![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("%dt",list[j]);
}
void main()
{
int list[MAX], num;
clrscr();
printf("nnn***** Enter the number of elements [Maximum 10] *****n");](https://image.slidesharecdn.com/6846236/85/week-20x-5-320.jpg)
week-20x
- 1. /* Write C program that implement the following sorting methods to sort a given list of integers in ascending order: ii) Quick sort */ #include <stdio.h> #define MAX 10 void swap(int *m,int *n) { int temp; temp = *m; *m = *n; *n = temp; } int get_key_position(int x,int y ) { return((x+y) /2); } // Function for Quick Sort void quicksort(int list[],int m,int n) { int key,i,j,k; if( m < n) {
- 2. k = get_key_position(m,n); swap(&list[m],&list[k]); key = list[m]; i = m+1; j = n; while(i <= j) { while((i <= n) && (list[i] <= key)) i++; while((j >= m) && (list[j] > key)) j--; if( i < j) swap(&list[i],&list[j]); } swap(&list[m],&list[j]); quicksort(list,m,j-1); quicksort(list,j+1,n); } } // Function to read the data void read_data(int list[],int n) { int j;
- 3. printf("nnEnter the elements:n"); for(j=0;j<n;j++) scanf("%d",&list[j]); } // Function to print the data void print_data(int list[],int n) { int j; for(j=0;j<n;j++) printf("%dt",list[j]); } void main() { int list[MAX], num; clrscr(); printf("n***** Enter the number of elements Maximum [10] *****n"); scanf("%d",&num); read_data(list,num); printf("nnElements in the list before sorting are:n"); print_data(list,num); quicksort(list,0,num-1); printf("nnElements in the list after sorting are:n");
- 4. print_data(list,num); getch(); } /* 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])
- 5. 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("%dt",list[j]); } void main() { int list[MAX], num; clrscr(); printf("nnn***** Enter the number of elements [Maximum 10] *****n");
- 6. scanf("%d",&num); readlist(list,num); printf("nnElements in the list before sorting are:n"); printlist(list,num); bub_sort(list,num); printf("nnElements in the list after sorting are:n"); printlist(list,num); getch(); }