fork download
  1. #include<stdio.h>
  2.  
  3. int find(int* arr,int* n,int value) {
  4. int index = *n;
  5. for(int i = 0;i < *n ;i++) {
  6. //Tim den khi thay phan tu lon hon so can chen thi dung
  7. if(arr[i] >= value) {
  8. index = i;
  9. break;
  10. }
  11. }
  12. //Tra ve vi tri can chen
  13. return index;
  14. }
  15.  
  16. void insert(int* arr,int* n,int idx,int value) {
  17. //Tang n len 1 vi them moi 1 phan tu
  18. *n += 1;
  19. //Chen tu phan tu thu n ve toi vi tri index+1
  20. for(int i = *n ; i >= idx+1 ; i--) {
  21. arr[i] = arr[i-1];
  22. }
  23. //Tai index thi chen gia tri can tim
  24. arr[idx] = value;
  25. }
  26.  
  27. int main() {
  28. int n;
  29. //Nhap so can dien
  30. scanf("%d", &n);
  31. int a[n];
  32. //Nhap mang co n phan tu
  33. for(int i = 0;i < n ; i++) {
  34. scanf("%d", &a[i]);
  35. }
  36. printf("Nhap so can chen :\n");
  37. int value;
  38. scanf("%d",&value);
  39. int x = find(a,&n,value);
  40. insert(a,&n,x,value);
  41. for(int i = 0;i < n ; i++) {
  42. printf("%d ",a[i]);
  43. }
  44. }
  45.  
Success #stdin #stdout 0s 5280KB
stdin
Standard input is empty
stdout
Nhap so can chen :
0