fork download
  1.  
  2. /*#include<stdio.h>
  3. void Insertion_sort(int n,int arr[]){
  4. printf("Insertion sort:");
  5. int count_com=0,count_ex=0;
  6. for(int j=1;j<n;j++){
  7.   int key=arr[j];
  8.   int i=j-1;
  9.   while(i>=0 &&arr[i]>key){
  10.   arr[i+1]=arr[i];
  11.   i--;
  12.   count_com++;
  13.   count_ex++;
  14.   }
  15.   count_com++;
  16.   arr[i+1]=key;
  17. }
  18. printf("\n Number of Comparison:%d,Number of Exchange: %d\n",count_com,count_ex);
  19. }
  20. int main(){
  21. int n;
  22. scanf("%d",&n);
  23. int a[n];
  24. for(int i=0;i<n;i++){
  25.   scanf("%d",&a[i]);
  26. }
  27. Insertion_sort(n,a);
  28. for(int i=0;i<n;i++){
  29.   printf("%d ",a[i]);
  30. }
  31. return 0;
  32. }
  33. */
  34. /*
  35. #include<stdio.h>
  36. int main(){
  37. int n;
  38. scanf("%d",&n);
  39. int arr[n];
  40. for(int i=0;i<n;i++){
  41.   scanf("%d",&arr[i]);
  42. }
  43. int small;
  44. for(int j=0;j<n-1;j++){
  45.   small=j;
  46.   for(int i=j;i<n;i++){
  47.   if(arr[i]<arr[small]){
  48.   small=i;
  49.   int temp=arr[j];
  50.   arr[j]=arr[small];
  51.   arr[small]=temp;
  52.   }
  53.   }
  54. }
  55. for(int i=0;i<n;i++){
  56.   printf("%d ",arr[i]);
  57. }
  58.  
  59.  
  60. }
  61. */
  62. #include<stdio.h>
  63. int main(){
  64. int n;
  65. scanf("%d",&n);
  66. int arr[n];
  67. for(int i=0;i<n;i++){
  68. scanf("%d",&arr[i]);
  69. }
  70. int small;
  71. for(int j=0;j<n-1;j++){
  72. small=j;
  73. for(int i=j;i<n;i++){
  74. if(arr[i]<arr[small]){
  75. small=i;
  76. int temp=arr[j];
  77. arr[j]=arr[small];
  78. arr[small]=temp;
  79. }
  80. }
  81. }
  82. float mean=0,median=0;
  83. for(int i=0;i<n;i++){
  84. mean+=arr[i];
  85. }
  86. mean=mean/n;
  87.  
  88.  
  89. if(n%2==0){
  90. median=(arr[n/2]+arr[n/2-1])/2;
  91.  
  92. }else{
  93. median=arr[(n-1)/2];
  94. }
  95. printf("Median is %d,mean:%d",median,mean);
  96.  
  97. }
  98.  
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
Median is 0,mean:2