C / C++ / MFC

#include <iostream><br />
#include<iomanip.h><br />
#include<math.h><br />
#include <ctime><br />
#include <cstdlib><br />
#include <math.h><br />
int com,call,move;<br />
#define MAX 10<br />
int array[1000];<br />
int arr[], n;<br />
<br />
<br />
//using namespace std; 	//introduces namespace std<br />
<br />
void insertionsort(int array[], int size);<br />
int count1,count2;<br />
void merge(int array[],int first,int mid,int last);<br />
void mergesort(int array[],int first,int last);<br />
void random(int sizeofarray);<br />
void partial(int sizeofarray);<br />
void sorted(int sizeofarray);<br />
void inverse(int sizeofarray);<br />
void insertion();<br />
	void random(int sizeofarray)<br />
	{<br />
			srand(time(NULL));<br />
		for (int i = 1 ; i <= sizeofarray ; i++)<br />
		{<br />
			array[i]=rand();<br />
			cout<<array[i]<<endl;<br />
	<br />
		}<br />
			<br />
	}<br />
<br />
	void inverse(int sizeofarray)<br />
	{<br />
		for(int i = sizeofarray ; i >= 1 ; --i)<br />
		{<br />
			array[i]=i;<br />
			cout<<array[i]<<endl;<br />
		}<br />
	}<br />
<br />
	void sorted(int sizeofarray)<br />
	{<br />
		for (int i = 1 ; i <= sizeofarray ; i++)<br />
		{<br />
			array[i]=i;<br />
			cout<<array[i]<<endl;<br />
		}<br />
	}<br />
<br />
	void partial(int sizeofarray)<br />
	{<br />
		for (int i = 1 ; i <= sizeofarray-5 ; i++)<br />
		{<br />
			array[i]=i;<br />
			cout<<array[i]<<endl;<br />
		}<br />
		for ( i = 10 ; i >= sizeofarray-5 ; i--)<br />
		{<br />
			array[i]=i;<br />
			cout<<array[i]<<endl;<br />
		}<br />
	}<br />
	<br />
<br />
<br />
<br />
<br />
void merge(int array[],int first,int mid,int last)<br />
{<br />
		int temp[1000];<br />
		int first1 = first;<br />
		int last1  = mid;<br />
		int first2 = mid + 1;<br />
		int last2  = last;<br />
<br />
		int index = first1;<br />
<br />
		for (;(first1 <= last1) && (first2 <= last2); ++index)<br />
		{<br />
			if (array[first1] < array[first2])<br />
			{<br />
				temp[index] = array[first1];<br />
				++first1;<br />
				com++;<br />
			}<br />
			else<br />
			{<br />
				temp[index] = array[first2];<br />
				++first2;<br />
				com++;<br />
			}<br />
		}<br />
	<br />
	<br />
	<br />
		<br />
		for (; first1 <= last1 ; ++first1 , ++index)<br />
		{<br />
			 temp[index] = array[first1];<br />
			 move++;<br />
		}<br />
		for (; first2 <= last2 ; ++first2 , ++index)<br />
		{<br />
			 temp[index] = array[first2];<br />
			 move++;<br />
		}<br />
		<br />
<br />
			for( index = first ; index <= last ; ++index)<br />
			{	<br />
				array[index]=temp[index];<br />
				move++;<br />
			}<br />
		<br />
}<br />
void mergesort(int array[],int first,int last)<br />
<br />
{<br />
		if (first < last)<br />
		{<br />
			int mid= (first + last)/2;<br />
			mergesort(array,first,mid);<br />
			mergesort(array,mid+1,last);<br />
			call++;<br />
			merge(array,first,mid,last);<br />
		}<br />
}<br />
<br />
void insertionSort()<br />
{<br />
	 arr[MAX],n;<br />
	<br />
	void getdata();<br />
	void showdata();<br />
	int sortLogic(int d[], int n2);<br />
};<br />
<br />
void sortLogic(int data[], int n)<br />
{<br />
	for (int i=1, j; i<n; i++)<br />
	{<br />
		int tmp = data[i];<br />
		for (j=i; j>0 && tmp<data[j-1]; j--)<br />
			data[j] = data[j-1];<br />
		data[j] = tmp;<br />
	}<br />
	<br />
}<br />
	<br />
<br />
void getdata()<br />
{<br />
	<br />
	cout<<"How many elements you require: ";<br />
	<br />
	cout<<"Enter the elements of your array: ";<br />
	cin>>n;<br />
	for (int i=0; i<n; i++)<br />
		cin>>arr[i];<br />
	sortLogic(arr,n);<br />
}<br />
<br />
void showdata()<br />
{	<br />
	cout<<"\n--Display--\n";<br />
	for (int i=0; i<n; i++)<br />
		cout<<arr[i]<<" ";<br />
}<br />
<br />
	<br />
<br />
	<br />
<br />
<br />
<br />
<br />
<br />
void main()<br />
<br />
{<br />
	int i;<br />
	int n=0;<br />
	double number;<br />
	int level;<br />
	int sizeofarray;<br />
	int operation;<br />
	int function;<br />
	int type;<br />
	int choices;<br />
	int choices1;<br />
	int choices2;<br />
//	int first, mid, last;<br />
<br />
	top:<br />
<br />
	cout<<"Welcome to my program assignment 1"<<endl;<br />
	cout<<""<<endl;<br />
	cout<<"Please choose the type of sorting you would like to use:"<<endl;<br />
	cout<<""<<endl;<br />
	cin>>choices;<br />
<br />
	switch(choices)<br />
	{<br />
	case 1:<br />
	insertionSort();<br />
	break;<br />
	case 2:<br />
	mergesort(array,0,n);<br />
	break;<br />
<br />
	default:<br />
	cout<<"Please enter either one of the number only"<<endl<<endl;<br />
	goto top;<br />
<br />
<br />
	cout<<"Enter the number of array size you wish to create : ";<br />
	cin>>sizeofarray;<br />
	cout<<"Your array size now is "<<sizeofarray<<endl<<endl;<br />
	cout<<"Now select which one fuction you want to sort !"<<endl;<br />
	cout<<"1) for using Random Array."<<endl;<br />
	cout<<"2) for using Partially Sorted Array."<<endl;<br />
	cout<<"3) for using Sorted Array."<<endl;<br />
	cout<<"4) for using Inversely Sorted Array."<<endl<<endl;<br />
	cout<<"Your choice is ";<br />
	cin>>function;<br />
	cout<<endl;<br />
<br />
	switch(function)<br />
	{<br />
	case 1:<br />
	random(sizeofarray);<br />
		break;<br />
	case 2:<br />
	partial(sizeofarray);<br />
		break;	<br />
	case 3:<br />
	sorted(sizeofarray);<br />
		break;<br />
	case 4:<br />
	inverse(sizeofarray);<br />
		break;<br />
		<br />
	default:<br />
		cout<<"Please enter the any above number only!"<<endl<<endl;<br />
		goto top;<br />
		break;<br />
	}<br />
<br />
	int first=0;<br />
	int last=sizeofarray-1;<br />
	mergesort( array,first,last);<br />
	cout<<endl<<"The above array is Unsorted Array :"<<endl;<br />
	<br />
	cout<<endl<<"The Sorted Array is show as below :"<<endl<<endl;<br />
	for ( i=1 ; i <= sizeofarray ; i++)<br />
	{<br />
		cout<<array[i]<<endl;	<br />
	}<br />
<br />
		for (n=0;n<20 && number<=sizeofarray ;n++)<br />
		{<br />
			number=pow(2,n);<br />
		}<br />
	level=n-2;<br />
	operation=3*count1-1;<br />
	cout<<endl<<"The total level is : "<<level<<endl;<br />
	cout<<"The total number of comparisons is : "<<com<<endl;<br />
	cout<<"The total number of move is : "<<move<<endl;<br />
	}<br />
<br />
}<br />
<br />
<br />
<br />