Big Sorting

                            Solution in C :

In   C++  :







#include<iostream>
#include<fstream>
#include<math.h>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<sstream>
#include<set>

using namespace std;

#define forn(i,n) for(int i=0;i<(int)(n); i++)
#define forsn(i,s,n) for(int i=(s);i<(int)(n); i++)
#define esta(x,v) (find((v).begin(),(v).end(),(x)) !=  (v).end())
#define index(x,v) (find((v).begin(),(v).end(),(x)) - (v).begin())
#define debug(x) cout << #x << " = "  << x << endl
#define pb push_back
#define mp make_pair

typedef long long tint;
typedef unsigned long long utint;
typedef long double ldouble;

typedef vector<int> vint;

int toNumber (string s)
{
	int Number;
	if ( ! (istringstream(s) >> Number) ) Number = 0; 
	return Number;
}

string toString (int number)
{
    ostringstream ostr;
    ostr << number;
    return  ostr.str();
}

int main (){
	int n;
	cin>>n;
	vector< pair<int, string> > v;
	forn(i,n){
		string s;
		cin>>s;
		v.pb(mp((int)s.size(), s));
	}
	sort(v.begin(), v.end());
	forn(i, n){
		cout<<v[i].second<<endl;
	}
	
}









In   Java  :







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

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        String[] unsorted = new String[n];
        for (int unsorted_i = 0; unsorted_i < n; unsorted_i++) {
            unsorted[unsorted_i] = in.next();
        }

        Arrays.sort(unsorted, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                if (o1.length() < o2.length()) {
                    return -1;
                }
                if (o1.length() > o2.length()) {
                    return 1;
                }
                return o1.compareTo(o2);
            }
        });

        for (String s : unsorted) {
            System.out.println(s);
        }
    }
}








In   C  :







#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int cmp(const void *p, const void *q)
{
    char* s1 = *(char**)p;
    char* s2 = *(char**)q;
    int s1l=strlen(s1);
    int s2l=strlen(s2);
    if(s1l>s2l)
    	return 1;
    if(s2l>s1l)
    	return -1;
    int i,flag=0;
    for(i=0;i<s1l;i++)
    {
    	if(s1[i]==s2[i])
    		continue;
    	else
    	{
    		flag=1;
    		break;
    	}
    }
    if(flag)
    {
    	return s1[i]-s2[i];
    }
    return 0;
}

int main(){
    int n,i,tl;
    scanf("%d\n",&n);
    char* str[n];
    char temp[1000001];
    for(i=0;i<n;i++)
    {
        scanf("%s",temp);
        tl=strlen(temp);
        str[i]=malloc(sizeof(char)*(tl+1));
    	strcpy(str[i],temp);
    }
    qsort((void*)str,n,sizeof(str[0]),cmp);
    for(i=0;i<n;i++)
        printf("%s\n",str[i]);
    return 0;
}









In  Python3 :







import sys


n = int(input().strip())
unsorted = []
unsorted_i = 0
for unsorted_i in range(n):
   unsorted_t = str(input().strip())
   unsorted.append(unsorted_t)

unsorted.sort(key = lambda x : int(x))
for u in unsorted:
    print(u)