Created
March 4, 2015 20:39
-
-
Save tywoplenty/64d8f37dab36e1910dee to your computer and use it in GitHub Desktop.
Playing around with mergeSort
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> | |
<CodeBlocks_project_file> | |
<FileVersion major="1" minor="6" /> | |
<Project> | |
<Option title="cMergesort" /> | |
<Option pch_mode="2" /> | |
<Option compiler="gcc" /> | |
<Build> | |
<Target title="Debug"> | |
<Option output="bin/Debug/cMergesort" prefix_auto="1" extension_auto="1" /> | |
<Option object_output="obj/Debug/" /> | |
<Option type="1" /> | |
<Option compiler="gcc" /> | |
<Compiler> | |
<Add option="-g" /> | |
</Compiler> | |
</Target> | |
<Target title="Release"> | |
<Option output="bin/Release/cMergesort" prefix_auto="1" extension_auto="1" /> | |
<Option object_output="obj/Release/" /> | |
<Option type="1" /> | |
<Option compiler="gcc" /> | |
<Compiler> | |
<Add option="-O2" /> | |
</Compiler> | |
<Linker> | |
<Add option="-s" /> | |
</Linker> | |
</Target> | |
</Build> | |
<Compiler> | |
<Add option="-Wall" /> | |
<Add option="-fexceptions" /> | |
</Compiler> | |
<Unit filename="main.cpp" /> | |
<Extensions> | |
<code_completion /> | |
<envvars /> | |
<debugger /> | |
<lib_finder disable_auto="1" /> | |
</Extensions> | |
</Project> | |
</CodeBlocks_project_file> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# depslib dependency file v1.0 | |
1422410514 source:c:\users\taiwo\desktop\grading program\cmergesort\main.cpp | |
<iostream> | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> | |
<CodeBlocks_layout_file> | |
<ActiveTarget name="Debug" /> | |
<File name="main.cpp" open="1" top="1" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0"> | |
<Cursor> | |
<Cursor1 position="0" topLine="65" /> | |
</Cursor> | |
</File> | |
</CodeBlocks_layout_file> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int a[50]; | |
void merge(int,int,int); | |
void merge_sort(int low,int high) | |
{ | |
int mid; | |
if(low<high) | |
{ | |
mid=(low+high)/2; | |
merge_sort(low,mid); | |
merge_sort(mid+1,high); | |
merge(low,mid,high); | |
} | |
} | |
void merge(int low,int mid,int high) | |
{ | |
int h,i,j,b[50],k; | |
h=low; | |
i=low; | |
j=mid+1; | |
while((h<=mid)&&(j<=high)) | |
{ | |
if(a[h]<=a[j]) | |
{ | |
b[i]=a[h]; | |
h++; | |
} | |
else | |
{ | |
b[i]=a[j]; | |
j++; | |
} | |
i++; | |
} | |
if(h>mid) | |
{ | |
for(k=j;k<=high;k++) | |
{ | |
b[i]=a[k]; | |
i++; | |
} | |
} | |
else | |
{ | |
for(k=h;k<=mid;k++) | |
{ | |
b[i]=a[k]; | |
i++; | |
} | |
} | |
for(k=low;k<=high;k++) a[k]=b[k]; | |
} | |
int main() | |
{ | |
cout << 5/2; | |
int num,i; | |
cout<<"********************************************************************************" <<endl; | |
cout<<" MERGE SORT PROGRAM "<<endl; | |
cout<<"********************************************************************************"<<endl; | |
cout<<endl<<endl; | |
cout<<"Please Enter THE NUMBER OF ELEMENTS you want to sort [THEN PRESS ENTER]:"<<endl; | |
cin>>num; | |
cout<<endl; | |
cout<<"Now, Please Enter the ( "<< num <<" ) numbers (ELEMENTS) [THEN PRESS ENTER]:"<<endl; | |
for(i=1;i<=num;i++) | |
{ | |
cin>>a[i] ; | |
} | |
merge_sort(1,num); | |
cout<<endl; | |
cout<<"So, the sorted list (using MERGE SORT) will be :"<<endl; | |
cout<<endl<<endl; | |
for(i=1;i<=num;i++) | |
cout<<a[i]<<" "; | |
cout<<endl<<endl<<endl<<endl; | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment