C :

#include<stdio.h>
#include<string.h>
int main()
{	
	char a[10][120],e[120];
	int i,j;
	for(i=0;i<10;i++)
	{
	gets(a[i]);
		
	}

	for(i=0;i<10;i++)
	{	
		
		for(j=i;j<10;j++)
		{
			if( strcmp(a[i],a[j]) > 0 )
			{strcpy(e,a[i]);
				strcpy(a[i],a[j]);
				strcpy(a[j],e);
			}
		}

	}
	for(i=0;i<10;i++)
	{
		puts(a[i]);
		
	}


	return 0;
}

C++ :

#include <stdio.h>
#include <string.h>
int main() {
	void sort(char str[][101], int n, int length);
	char str[10][101], ch;
	int i, j, length;
	for (i = 0;i < 10;i++) {
		j = 0;
		while ((ch = getchar()) != '\n') {
			str[i][j] = ch;
			j++;
		}
		length = j;
		str[i][length] = '\0';
	}
	sort(str, 10, length);
	for (i = 0;i < 10;i++)
		printf("%s\n", str[i]);
	return 0;
}
/* 字符串排序函数 */
void sort(char str[][101], int n, int length) {
	int i, j, current;
	char temp;
	for (i = 0;i < n - 1;i++) {
		/* 寻找剩余的最小的字符串 */
		current = i;
		for (j = i + 1;j < n;j++)
			if (strcmp(str[j], str[current]) < 0)
				current = j;
		/* 将剩余的最小字符串替换到最靠前的位置 */
		for (j = 0;j < length;j++) {
			temp = str[i][j];
			str[i][j] = str[current][j];
			str[current][j] = temp;
		}
	}
}

Pascal :

const n=10;
var
  t:string;
  i,j:longint;
  a:array[1..n] of string;
begin
  for i:=1 to n do
  readln(a[i]);
  for i:=1 to n-1 do
    for j:=i+1 to n do
    if a[i]>a[j] then begin t:=a[i]; a[i]:=a[j]; a[j]:=t; end;
  for i:=1 to n do
  writeln(a[i]);
end.

Java :

import java.util.Arrays;
import java.util.Scanner;

public class Main{
   private static Scanner s = new Scanner(System.in) ;
   
   public static void main(String[] args) {
	   String strs[] = new String[10] ;
	   for (int i = 0; i < 10; i++) {
		  strs[i] = s.nextLine() ;
	   }
	   
	   Arrays.sort(strs);
	   
	   for (String string : strs) {
		  System.out.println(string);
	   }
   }
}