make flowchart for this one plz #include int sortingbook(int array[], int N) { int count = 0, i , j , k , minimum , index , flag = 0; for(i=0;ii ; k--) //shifting one position to the right from index to i array[k] = array[k-1]; if(array[i]!=minimum) count++; //if the value of min chganged from previous assumption array[i] = minimum; } return count; } int main() { int array[20],i,N,c; printf("\nEnter number of books(N) : "); scanf("%d",&N); //number of books printf("\nEntercurrent sequence of %d books : \n=> ",N); for(i=0;i "); for(i=0;i
make flowchart for this one plz
#include<stdio.h>
int sortingbook(int array[], int N)
{
int count = 0, i , j , k , minimum , index , flag = 0;
for(i=0;i<N;i++)
{
minimum = array[i]; //ith element as the minimum
index = i; //setting index value as i
for( j = i; j < N; j++)
{
if(array[j] < minimum)
{
minimum = array[j]; //calculating minimum
index = j; //assigning the minimum position into index
}
}
for(k = index; k>i ; k--) //shifting one position to the right from index to i
array[k] = array[k-1];
if(array[i]!=minimum)
count++; //if the value of min chganged from previous assumption
array[i] = minimum;
}
return count;
}
int main()
{
int array[20],i,N,c;
printf("\nEnter number of books(N) : ");
scanf("%d",&N); //number of books
printf("\nEntercurrent sequence of %d books : \n=> ",N);
for(i=0;i<N;i++)
scanf("%d",&array[i]); //reading sqeuence
c = sortingbook(array,N);
printf("\nSorted sequence is :\n=> ");
for(i=0;i<N;i++) //printing final sequence
printf("%4d",array[i]);
printf("\nThe minimum number of moves required for sorting : %d\n",c);
return 0;
}
Step by step
Solved in 3 steps with 2 images