C :

#include<stdio.h>
int main(){
	int n,m;
	int a[50];
	int i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	scanf("%d",&m);
	for(i=0;i<n;i++){
		if(a[i]>m)
			break;
	}
	for(j=n;j>i;j--)
		a[j]=a[j-1];
	a[i]=m;
	for(i=0;i<n+1;i++)
		printf("%d ",a[i]);
	printf("\n");
	return 0;
}

C++ :

#include <stdio.h>
int main() {
	int dat[51];
	int n, i, j, insert;
	scanf("%d", &n);
	for (i = 0;i < n;i++)
		scanf("%d", &dat[i]);
	scanf("%d", &insert);
	i = 0;
	while (i < n && dat[i] < insert)
		i++;
	for (j = n;j > i;j--)
		dat[j] = dat[j - 1];
	dat[i] = insert;
	for (i = 0;i < n + 1;i++)
		printf("%d ", dat[i]);
	puts("");
	return 0;
}

Pascal :

var
  a:array[0..100] of longint;
  n,i,j:longint;

begin
  readln(n);
  for i:=1 to n do read(a[i]);
  read(a[0]);
  i:=1;
  while(a[i]<a[0]) do inc(i);
  for j:=n downto i do a[j+1]:=a[j]; //往后移动一个位置
  a[i]:=a[0];
  for i:=1 to n+1 do write(a[i],' ');
  writeln;
end.

Java :

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
   private static Scanner s = new Scanner(System.in) ;
   
   public static void main(String[] args) {
	  int num = s.nextInt() ;
	  List<Integer> list = new ArrayList<Integer>() ;
	  for (int i = 0; i < num; i++) {
		  int temp = s.nextInt() ;
		  list.add(temp) ;
	  }
	  
	  int n = s.nextInt() ;
	  list.add(n) ;
	  
	  Collections.sort(list);
	  
	  for (Integer integer : list) {
		System.out.print(integer+" ");
	}
	  System.out.println() ;
   }
}

Python :

n = input()
a = [int(i) for i in raw_input().split()]
b = input()
d = True
for j in range(n+1):
    if b < a[j] and d:
        a.insert(j, b)
        d = False
    print a[j],
print ""