1. #define maxsize 6

2. void quicksort(int arr[], int low, int high) {

3. int i = low;

4. int j = high;

5. int y = 0;

6. /* compare value */

7. int z = arr[(low + high) / 2];

8.

9. /* partition */

10. do {

11. /* find member above ... */

12. while(arr[i] < z) i++;

13.

14. /* find element below ... */

15. while(arr[j] > z) j--;

16.

17. if(i <= j) {

18. /* swap two elements */

19. y = arr[i];

20. arr[i] = arr[j];

21. arr[j] = y;

22. i++;

23. j--;

24. }

25. } while(i <= j);

26.

27. /* recurse */

28. if(low < j)

29. quicksort(arr, low, j);

30.

31. if(i < high)

32. quicksort(arr, i, high);

33. }

mergesort(int a[], int low, int high)

{

int mid;

if(low

{

mid=(low+high)/2;

mergesort(a,low,mid);

mergesort(a,mid+1,high);

merge(a,low,high,mid);

}

return(0);

}

merge(int a[], int low, int high, int mid)

{

int i, j, k, c[50];

i=low;

j=mid+1;

k=low;

while((i<=mid)&&(j<=high))

{

if(a[i]

{

c[k]=a[i];

k++;

i++;

}

else

{

c[k]=a[j];

k++;

j++;

}

}

while(i<=mid)

{

c[k]=a[i];

k++;

i++;

}

while(j<=high)

{

c[k]=a[j];

k++;

j++;

}

for(i=low;i

{

a[i]=c[i];

}

}

void bubble(int a[],int n)
{
int i,j,t;
for(i=n-2;i>=0;i--)
{
for(j=0;j<=i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}//end for 1.
void restoreHup(int *a,int i)
{
int v=a[i];
while((i>1)&&(a[i/2]
{
a[i]=a[i/2];
i=i/2;
}
a[i]=v;
}
void restoreHdown(int *a,int i,int n)
{
int v=a[i];
int j=i*2;
while(j<=n)
{
if((j
j++;
if(a[j]
a[j/2]=a[j];
j=j*2;
}
a[j/2]=v;
}

79. main()

80. {

81. int i,s;

82. printf("enter the number of numbers to be entered \n");

83. scanf("%d",&s);

84. for(i=0;i)

85. {

86. printf("enter the number \n" );

87. scanf("%d",&A[i]);

88. }

89. printf("array before sorting ");

90. Printf("1.quick 2.merge 3.merge")

91. Printf("enter your choice");

92. Scanf("%d",&ch);

93. Switch(ch)

94. {

95. Case: printf("you have opted for quicksort");

96. Quicksort(A,0,n-1);

97. Break;

98. Case 2:printf("merge sort");

99. Mergesort(A,0,n-1);

100.Break;

101.Case 3:printf("heap sort");

102. Heapsort(A,n);

103.break;

104.case 4:printf("heap sort")

105.

106.Default:printf( "you have enterd wrong choice");

107.}

108.For (i=0;i

109.Printf("%d",A[i]);

110.}

HERE AFTER COMPLIATION IT IS SHOWING ME DECLARATION SYNTAX ERROR HOW I CORRECT THIS

Resources

Top Categories

Product

Company