C :

#include<stdio.h>
#include<string.h>
int main()
{
	char str[5][100];
	char *p[5];
	char temp[100];
	char *t=temp;
	int i;
	int j;
	for(i=0;i<5;i++)
	{
		gets(str[i]);
		p[i]=str[i];
	}
	for(i=0;i<4;i++)
	{
		for(j=i+1;j<5;j++)
		{
			if(strcmp(p[i],p[j])>0)
			{
				t=p[i];
				p[i]=p[j];
				p[j]=t;
			}
		}
	}
	for(i=0;i<5;i++)
	{
		puts(p[i]);
	}
	return 0;
}

C++ :

#include <stdio.h>
#include <string.h>
int main() {
	void sort(char *strings[], int n);
	char *strings[5];
	char buffer[5][101];
	int i;
	for (i = 0;i < 5;i++) {
		scanf("%s", buffer[i]);
		strings[i] = buffer[i];
	}
	sort(strings, 5);
	for (i = 0;i < 5;i++)
		printf("%s\n", strings[i]);
	return 0;
}
/* 字符串选择排序函数 */
void sort(char *strings[], int n) {
	int i, j;
	char **p, *temp;
	for (i = 0;i < n - 1;i++) {
		p = strings + i;
		for (j = i + 1;j < n;j++) {
			if (strcmp(strings[j], *p) < 0)
				p = strings + j;
		}
		temp = *p; *p = strings[i]; strings[i] = temp;
	}
}

Pascal :

var
  a:array[1..5] of string;
  i,j,n:longint;
  t:string;
begin
  n:=5;
  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[5] ;
	  for (int i = 0; i < 5; i++) {
		String str = s.next() ;
		if(str.length()<=100)
			strs[i] = str ;
	
	  }
	  
	  Arrays.sort(strs);
	  
	  for (int i = 0; i < strs.length; i++) {
		 System.out.println(strs[i]) ;
	  }
   }
}