godlike_pong
Eternal Poster
- Joined
- Feb 9, 2017
- Posts
- 380
- Reaction
- 311
- Points
- 257
- Age
- 7
#include<stdio.h>
#include<conio.h>
void merge(int [],int ,int ,int );
void part(int [],int ,int );
int main()
{
int arr[30];
int i,size;
printf("\n\t––––––– Merge sorting method –––––––\n\n");
printf("Enter total no. of elements : ");
scanf("%d",&size);
for(i=0; i<size; i++)
{
printf("Enter %d element : ",i+1);
scanf("%d",&arr);
}
part(arr,0,size–1);
printf("\n\t––––––– Merge sorted elements –––––––\n\n");
for(i=0; i<size; i++)
printf("%d ",arr);
getch();
return 0;
}
program po yan sa merge sort.. kasu d ko ma gets.. cnu po marung gumawa ng flow chart jan....
pa help naman po...
#include<conio.h>
void merge(int [],int ,int ,int );
void part(int [],int ,int );
int main()
{
int arr[30];
int i,size;
printf("\n\t––––––– Merge sorting method –––––––\n\n");
printf("Enter total no. of elements : ");
scanf("%d",&size);
for(i=0; i<size; i++)
{
printf("Enter %d element : ",i+1);
scanf("%d",&arr);
}
part(arr,0,size–1);
printf("\n\t––––––– Merge sorted elements –––––––\n\n");
for(i=0; i<size; i++)
printf("%d ",arr);
getch();
return 0;
}
program po yan sa merge sort.. kasu d ko ma gets.. cnu po marung gumawa ng flow chart jan....
pa help naman po...