Quick Sort

#include<stdio.h> void swap(int* a, int* b) { int t = *a; *a = *b; *b = t; } int partition(int arr[], int p , int q) { int x= arr[p]; int i= p; for(int j=p+1;j<=q;j++) { if(arr[j]<x) { i++; swap(&arr[i],&arr[j]); } } swap(&arr[p],&arr[i]); return i; } void QuickSort(int arr[],int p, int q) { if(p<q) {...

Merge Sort

#include<stdio.h> void mergesort(int a[],int i,int j); void merge(int a[],int i1,int j1,int i2,int j2); int main() { int a[30],n,i; printf("Enter no of elements:"); scanf("%d",&n); printf("Enter array elements:"); for(i=0;i<n;i++) scanf("%d",&a[i]); mergesort(a,0,n-1); printf("\nSorted array is :"); for(i=0;i<n;i++) printf("%d ",a[i]); return 0; } void mergesort(int a[],int i,int j) { int mid; if(i<j) { mid=(i+j)/2; mergesort(a,i,mid); //left recursion mergesort(a,mid+1,j); //right...

Generating Random numbers in a given range.

#include <stdio.h> #include <stdlib.h> int main() { int num, randomnum; printf("Enter the number of random numbers you want to enter: \n"); scanf("%d",&num); printf("%d Random no. b/w to 10-99: \n",num); while (num--) { randomnum=rand()%90+10; printf("%d\n",randomnum); } getch(); return 0; }