fork download
copy 
  1. // InsertionSort
  2.  
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5.  
  6. void printA(int a[], int n){
  7.     int i;
  8.     for(i=0;i<n;i++){
  9.         printf("%d ",a[i]);
  10.     }
  11.     printf("\n");
  12. }
  13.  
  14. void swap(int* a, int* b){
  15.     int  tmp;
  16.     tmp = *a;
  17.     *a = *b;
  18.     *b = tmp;
  19. }
  20.  
  21. void InsertionSort(int a[], int n){
  22. 	//ここを書く
  23. 	int i, j, k;
  24. 	for(i=1;i<n;i++){
  25. 		j=a[i];
  26. 		for(k=i-1;j<a[k]&&k>=0;k--){
  27. 			a[k+1]=a[k];
  28. 		}
  29. 		a[k+1]=j;
  30. 		//printf("%d,%d,%d\n",i,j,k+1);
  31. 		//printA(a,n);
  32. 	}
  33. }
  34.  
  35. int main(void){
  36.     int n,i;
  37.     int *v;
  38.     scanf("%d",&n);
  39.     v = (int*)malloc(sizeof(int)*n);
  40.     if(v==NULL){
  41.         printf("ERROR\n");
  42.         return -1;
  43.     }
  44.     for(i=0;i<n;i++){
  45.         scanf("%d",&v[i]);
  46.     }
  47.     InsertionSort(v,n);
  48.     printA(v,n);
  49.     free(v);
  50.     return 0;
  51. }
  52.  
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
8
21 55 5 13 8 2 34 3
stdout
copy 
2 3 5 8 13 21 34 55
https://ideone.com/1vyNYB
第4回課題2
language:
C (gcc 8.3)
created:
2 days ago
visibility:
public

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!