fork(1) download 
  1. #include<stdio.h>
  2. void sort_rows(int *arr,int n)
  3. {
  4. 	int i;
  5. 	for(i=1;i<n;i++)
  6. 	{
  7. 		int key=arr[i];
  8. 		int j=i-1;
  9. 		while(j>=0 && key<arr[j])
  10. 		{
  11. 			arr[j+1]=arr[j];
  12. 			j--;
  13. 		}
  14. 		arr[j+1]=key;
  15. 	}
  16. }
  17. void sort_column(int arr[][3],int column)
  18. {
  19. 	int key,k;
  20. 	int i,j;
  21. 	for(i=0;i<column;i++)
  22. 	{
  23. 		for(j=1;j<column;j++)
  24. 		{
  25. 			key=arr[j][i];
  26. 			k=j-1;
  27. 			while(k>=0 && arr[k][i]>key)
  28. 			{
  29. 				arr[k+1][i]=arr[k][i];
  30. 				k--;
  31. 			}
  32. 			arr[k+1][i]=key;
  33. 		}
  34. 	}
  35. }
  36. int main()
  37. {
  38. 	int arr[][3]={{9,8,7},{6,5,4},{3,2,1}};
  39. 	int i,j,size_row,size_column;
  40. 	printf("Original array:\n");
  41. 	for(i=0;i<3;i++)
  42. 	{
  43. 		for(j=0;j<3;j++)
  44. 		{
  45. 			printf("%d ",arr[i][j]);
  46.  
  47. 		}
  48. 		printf("\n");
  49. 	}
  50. 	size_row=((sizeof(arr)/sizeof(arr[0][0])/(sizeof(arr[0])/sizeof(arr[0][0]))));
  51. 	for(i=0;i<size_row;i++)
  52. 	{
  53. 		sort_rows(arr[i],sizeof(arr[i])/sizeof(arr[i][0]));
  54. 	}
  55. 	size_column=sizeof(arr)/sizeof(arr[0]);
  56. 	for(i=0;i<size_column;i++)
  57. 	{
  58. 		sort_column(arr,size_column);
  59. 	}
  60. 	printf("Sorted Array:\n");
  61. 	for(i=0;i<3;i++)
  62. 	{
  63. 		for(j=0;j<3;j++)
  64. 		{
  65. 			printf("%d ",arr[i][j]);
  66.  
  67. 		}
  68. 		printf("\n");
  69. 	}
  70. 	return 0;
  71. }
Success #stdin #stdout 0s 2160KB
comments ()
stdin 
Standard input is empty
stdout 
Original array:
9 8 7 
6 5 4 
3 2 1 
Sorted Array:
1 2 3 
4 5 6 
7 8 9
https://ideone.com/iLeFfr
language:
C (gcc 8.3)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!