#include <iostream.h> #include <conio.h> void main() { void srt(int[],int,int); int a[10],count=0,n; clrscr(); cout<<”Ener 10 values in unsorted order : \n”; for (n=0;n<10;n++) { cout<<”value no.: “<<(n+1)<>a[n]; count++; } n=0; clrscr(); srt(a,n,count-1); clrscr(); cout<<”\t\tThe Sorted order is : \n”; for (n=0;n<10;n++) { cout<<”\t\tposition : “<<(n+1)<<”\t”<<a[n]<<”\n”; } getch(); } void srt(int k[20],int lb,int ub) { int i,j,key,flag=0,temp; [...]
Posts Tagged ‘sorting algorithm’
#include <iostream.h> #include <conio.h> #define MAX 10 class bubsort{ int arr[MAX],n; public: void getdata(); void showdata(); void sortLogic(); }; void bubsort :: getdata(){ cout<>n; for(int i=0;i>arr[i]; } void bubsort :: showdata(){ cout<<”\n–Display–\n”; for(int i=0;i<n;i++) cout<<arr[i]<<” “; } void bubsort :: sortLogic(){ int temp; for(int i=0;i<n;i++){ for(int j=0,exchange=0;j arr[j+1]){ temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] [...]
#include <iostream.h> #include <conio.h> #define MAX 10 static int merge_arr[MAX+MAX],sort_arr[MAX+MAX]; class mergesort{ int arr1[MAX],arr2[MAX],n1,n2,n3; public: void getdata(); void showdata(int); void mergeLogic(); void sortLogic(); }; void mergesort :: getdata(){ int i; cout<<”\n–Data Must be Entered in Sorted Order for each Array–\n\n”; cout< Array: “; cin>>n1; for(i=0;i>arr1[i]; cout< Array: “; cin>>n2; for(i=0;i>arr2[i]; n3=n1+n2; } void mergesort :: [...]
