/*****
 * I solved this some 35 hours ago but PHCN wont let me post it mstcheeeww!!!  
 */
import java.util.*;
public class SortBlaBla {
  
    public static void main(String[] args)
    {
     //read from statndard input bla bla bla
     String input ="1 this a 8 for 7 z you s d 1";
     int max = input.length();
    Queue theInputQueue = new Queue(max);
    Queue theIntQueue = new Queue(max);
    Queue theStringQueue = new Queue(max); 
    
    String[] firstArray = input.split("\\s";
         for(int i=0; i<firstArray.length; i++)
         {
             theInputQueue.insert(String.valueOf(firstArray[i]));
         }
         Arrays.sort(firstArray);
          for(int i=0; i<firstArray.length; i++)
         {
             if(isInt(firstArray[i].toString()))
             {
                 theIntQueue.insert((firstArray[i]));
             }
             else
             {
                 theStringQueue.insert(firstArray[i]);
             }
         }
while(!theInputQueue.isEmpty())
          {
              if(isInt(theInputQueue.remove()))
                  System.out.println(theIntQueue.remove());
              else
                   System.out.println(theStringQueue.remove());
                  
          }
    }
     //Check if a value is an integer
    public static boolean isInt(String s)
    {
        try
        {
            Integer.parseInt(s);
        }
        catch(NumberFormatException ex)
        {
            return false;
        }
        return true;
    }
}
//you can ignore this part of the code...you can replace it with a STL
class Queue
{
    private int maxSize;
    private String[] queArray;
    private int front;
    private int rear;
    private int nItems;

    Queue(int s) 
    {
        maxSize = s;
        queArray = new String[maxSize];
        front = 0;
        rear = -1;
        nItems = 0;
    }

    void insert(String j) // put item at rear of queue
    {
        if(rear == maxSize-1) // deal with wraparound
        rear = -1;
        queArray[++rear] = j; // increment rear and insert
        nItems++; // one more item
    }
    public String remove() 
    {
        String temp = String.valueOf(queArray[front++]); 
        if(front == maxSize) 
        front = 0;
        nItems--; 
        return temp;
    }
public String peekFront() // peek at front of queue
    {
        return queArray[front];
    }
    boolean isEmpty() // true if queue is empty
    {
      return (nItems==0);
    }
    boolean isFull() // true if queue is full
    {
        return (nItems==maxSize);
    }
    int size() // number of items in queue
    {
        return nItems;
    }
}
//Boy!...Never new it would be more difficult to post a code than writing the actual code...P.H.C.N i dey hail o! mstcheeew!!            

Javanian:

/*****
 * I solved this some 35 hours ago but PHCN wont let me post it mstcheeeww!!!  
 */
import java.util.*;
public class SortBlaBla {
  
    public static void main(String[] args)
    {
     //read from statndard input bla bla bla
     String input ="1 this a 8 for 7 z you s d 1";
     int max = input.length();
    Queue theInputQueue = new Queue(max);
    Queue theIntQueue = new Queue(max);
    Queue theStringQueue = new Queue(max); 
    
    String[] firstArray = input.split("\\s";
         for(int i=0; i<firstArray.length; i++)
         {
             theInputQueue.insert(String.valueOf(firstArray[i]));
         }
         Arrays.sort(firstArray);
          for(int i=0; i<firstArray.length; i++)
         {
             if(isInt(firstArray[i].toString()))
             {
                 theIntQueue.insert((firstArray[i]));
             }
             else
             {
                 theStringQueue.insert(firstArray[i]);
             }
         }
while(!theInputQueue.isEmpty())
          {
              if(isInt(theInputQueue.remove()))
                  System.out.println(theIntQueue.remove());
              else
                   System.out.println(theStringQueue.remove());
                  
          }
    }
     //Check if a value is an integer
    public static boolean isInt(String s)
    {
        try
        {
            Integer.parseInt(s);
        }
        catch(NumberFormatException ex)
        {
            return false;
        }
        return true;
    }
}
//you can ignore this part of //the code...you can replace it with //a STL
class Queue
{
    private int maxSize;
    private String[] queArray;
    private int front;
    private int rear;
    private int nItems;

    Queue(int s) // constructor
    {
        maxSize = s;
        queArray = new String[maxSize];
        front = 0;
        rear = -1;
        nItems = 0;
    }

    void insert(String j) // put item at rear of queue
    {
        if(rear == maxSize-1) // deal with wraparound
        rear = -1;
        queArray[++rear] = j; // increment rear and insert
        nItems++; // one more item
    }
    public String remove() 
    {
        String temp = String.valueOf(queArray[front++]); 
        if(front == maxSize) 
        front = 0;
        nItems--; 
        return temp;
    }
public String peekFront() // peek at front of queue
    {
        return queArray[front];
    }
    boolean isEmpty() // true if queue is empty
    {
      return (nItems==0);
    }
    boolean isFull() // true if queue is full
    {
        return (nItems==maxSize);
    }
    int size() // number of items in queue
    {
        return nItems;
    }
}
//Boy!...Never new it would be //more difficult to post a code //than writing the actual //code...P.H.C.N i dey hail o! //mstcheeew!!            

Javanian: Where is @ekt_bear??

₱®ÌИСΞ:
http://pastebin.com/rbcJmEaR

my python implementation...took me less than 30 mins tho ...

#include <string>
#include <vector>
#include <functional>
#include <iostream>
#include <algorithm>
#include <sstream>

using namespace std;

void split(const string& s, char c,
           vector<string>& v) {
   string::size_type i = 0;
   string::size_type j = s.find(c);

   while (j != string::npos) {
      v.push_back(s.substr(i, j-i));
      i = ++j;
      j = s.find(c, j);

      if (j == string::npos)
         v.push_back(s.substr(i, s.length( )));
   }
}

bool isIntergerFamily(string value){
      int myint =0;
      stringstream(value) >> myint;
      if (myint != 0){
          return true;
      }else{
          return false;
      }
}


template <class T>
void printOut(vector<T> temp ){
       for (int i = 0; i < temp.size( ); ++i) {
             cout << temp[i] << " ";
        }
}

template <class T>
void maskOrder(string type, vector<T> inputVector, vector<string>& maskVector ){
       stringstream ss;
       for (int i = 0,counter = 0; i < maskVector.size( ) && counter < inputVector.size() ; ++i) {
             if(type == "int" && isIntergerFamily(maskVector[i])){
                 ss.str("";
                 ss << inputVector[counter];
                 maskVector[i] =  ss.str();
                 counter++;
             }
             if(type == "string" && !isIntergerFamily(maskVector[i])){
                maskVector[i] = inputVector[counter];
                counter++;
             }
       }
}

int main( ) {
   vector<string> splittedString;
   vector<string> tempVector;
   vector<string> stringVector;
   vector<int> intergersVector;
   int myint;

   string inputString;
   cout << "Enter String :";
   getline(cin,inputString);
   split(inputString, ' ', splittedString);

   tempVector = splittedString;
   sort(tempVector.begin(),tempVector.end());

   for (int i = 0; i < tempVector.size( ); ++i) {
      if (isIntergerFamily(tempVector[i])){
          stringstream(tempVector[i]) >> myint;
          intergersVector.push_back(myint);
      }else{
          stringVector.push_back(tempVector[i]);
      }
   }
   maskOrder("string",stringVector,splittedString);
   maskOrder("int",intergersVector,splittedString);
   printOut(splittedString);
}

brokoto: Biko warris this doing on the FP?

eaglechild:
It tells the world that Nigerians are smart too.
Guess that's what the mod was thinking.
Though he forgot how very esoteric the topic is.

lordZOUGA: @jacob05, nice one boss. Seems as if you learnt coding with "C++ cookbook"... You can do better though