C :

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main()
{
  int m,n,i,j,k;
  char s[30];
  scanf("%d",&m);
  while(m--){
    scanf("%s",s);
    n=strlen(s);
    //printf("%d\n",n);
    for(i=0;i<n;i++){
      k=i;
      for(j=i;j<n;j++)
        if(s[j]<s[k])k=j;
      putchar(s[k]);
      //printf("  %d   ",k);
      s[k]=s[i];
    }
    putchar('\n');
  }
}

C++ :

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;

int main()
{
    //freopen("test.in", "r", stdin);
    //freopen("test.out", "w", stdout);
    int t;
    cin >> t;
    while (t--) {
        string s;
        cin>>s;
        sort(s.begin(),s.end());
        cout<<s<<endl;
    }
    return 0;
}

Pascal :

 var
   m,k,l,i,j:integer;
   s:string;
   t:char;
  begin
  readln(m);
  for k:=1 to m do
   begin
   readln(s);
   l:=length(s);
   for i:=1 to l-1 do
    for j:=i+1 to l do
    if s[i]>s[j] then
     begin
      t:=s[i];
      s[i]:=s[j];
      s[j]:=t;
     end;
     writeln(s);
     end;
  end.

Java :

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

public class Main {
   public static void main(String[] args) {
	  Scanner s = new Scanner(System.in) ;
	  
	  int n = s.nextInt() ;
	  
	  for (int i = 0; i < n; i++) {
		 String str = s.next() ;
		 
		 char[]c = str.toCharArray() ;
		 
		 Arrays.sort(c) ;
		 
		 for (int j = 0; j < c.length; j++) {
		    System.out.print(c[j]) ;	
		 }
		 System.out.println();
	  }
   }
}