C program of Pancake Sort Algorithm | C code champ

# C program of Pancake Sort Algorithm | C code champ

2878
2
SHARE

C program of Pancake Sort Algorithm : Pancake sorting is a variation of the sorting problem in which the only allowed operation is to flip or swap the elements of some prefix of the sequence. Unlike a traditional sorting algorithm, which attempts to sort in fewest comparisons possible, the goal ofÂ  Pancake sorting algorithm also is to sort the sequence in as few reversals as possible. This operation can be visualized by thinking of a stack of pancakes in which one is allowed to take the top k pancakes and flip them. Let us see how to write a .

### C program of Pancake Sort Algorithm :

```#include<stdio.h>
#include<conio.h>
#include <stdio.h>

void do_flip(int *list, int length, int num)
{
int swap;
int i=0;
for(i;i<--num;i++)
{
swap=list[i];
list[i]=list[num];
list[num]=swap;
}
}
int pancake_sort(int *list, int length)
{
//If it's less than 2 long, just return it as sorting isn't really needed...
if(length<2)
return 0;

int i,a,max_num_pos,moves;
moves=0;

for(i=length;i>1;i--)
{
//Find position of the max number in pos(0) to pos(i)
max_num_pos=0;
for(a=0;a<i;a++)
{
if(list[a]>list[max_num_pos])
max_num_pos=a;
}

if(max_num_pos==i-1)
//It's where it need to be, skip
continue;

//Get the found max number to the beginning of the list (unless it already is)
if(max_num_pos)
{
moves++;
do_flip(list, length, max_num_pos+1);
}

//And then move it to the end of the range we're working with (pos(0) to pos(i))
moves++;
do_flip(list, length, i);

//Then everything above list[i-1] is sorted and don't need to be touched
}
return moves;
}

int main()
{
int i,n, array[20], c, d, t;
printf("-----------------------------------------------------------\n");
printf("-----------------------------------------------------------\n\n");
printf("\t\tPANCAKE SORT ALGORITHM\n\n\n\n");
printf("Enter the number of input : ");
scanf("%d",&n);
printf("\n\nEnter the elements to be sorted :\n");
for ( i = 0; i < n; i++)
{
scanf("%d",&array[i]);
}

pancake_sort(array,n);
printf("\n\nSorted List by Pancake Sort :\n");
for ( i = 0; i < n; i++)
{
printf("%d\t",array[i]);
}
getch();
return 0;
}```

We hope you all have enjoyed the for Pancake Algorithm. If you have any issues or problems with above code, ask us in form of comments.

SHARE
Previous articleC program for Insertion Sort Algorithm
Well, I am software programmer and love to code. My hobbies is to do Hacking, Coding, Blogging, Web Designing and playing online games. Feel free to contact me at shiviskingg@gmail.com or lokesh@hackingloops.com