₦airaland Forum

/*****
 * 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!!            

ekt_bear: Why not use the java collections heap rather than implementing your own?

class Node
{
        private int iData;

        Node(int key)
        { iData = key; }

        int getKey()
        { return iData; }

        void setKey(int id)
        { iData = id; }
}
        class Heap
        {
            private Node[] heapArray;
            private int maxSize; // size of array
            private int currentSize; // number of nodes in array

        Heap(int mx) 
        {
            maxSize = mx;
            currentSize = 0;
            heapArray = new Node[maxSize];
            
            for(int i=0; i<heapArray.length; i++)
                {
                    Node newNode = new Node(0);
                     heapArray[i] = newNode;
                    currentSize++;              
                }    
        }

        boolean isEmpty()
        { return currentSize==0; }

        boolean insert(int key)
        {
            for(int i=0; i<heapArray.length; i++)
                {
                                          Node newNode = new Node(key);
                    while(newNode.getKey() > heapArray[i].getKey())   
                    {
                        Node temp = heapArray[i];
                        heapArray[i] = newNode;
                        change(i+1, temp.getKey());
                        trickleUp(i);
                        return true;    
                    }
                }
             return true;
        } 

        void trickleUp(int index)
        {
            int parent = (index-1) / 2;
            Node bottom = heapArray[index];
                while( index > 0 &&
                heapArray[parent].getKey() < bottom.getKey() )
                {
                    heapArray[index] = heapArray[parent]; // move it down
                    index = parent;
                    parent = (parent-1) / 2;
                } 
                heapArray[index] = bottom;
        } 
       
       public boolean change(int index, int newValue)
        {
            if(index<0 || index>=currentSize)
            return false;
            int oldValue = heapArray[index].getKey(); // remember old
            heapArray[index].setKey(newValue); // change to new
            if(oldValue < newValue) // if raised,
            trickleUp(index); // trickle it up
            return true;
        } 
        public void displayHeap()
        {
                for(int i=0; i<heapArray.length; i++)
            {
                System.out.println(heapArray[i].getKey());
            }
        } 
      
} 
class HeapApp
{
       public static void main(String[] args) 
       {
            Heap theHeap = new Heap(2); 
            theHeap.insert(7000000); 
            theHeap.insert(4000);
            theHeap.insert(50000);
            theHeap.insert(20);
            theHeap.insert(-1);
            theHeap.insert(100);
            theHeap.insert(8000);
            theHeap.insert(30);
            theHeap.insert(10);
            theHeap.insert(900000000);

            theHeap.displayHeap();
            
           
       }
}

/**PHCN has decided to abandon us, so i wrote this code from a mobile phone, if it works its my code else @ekt_bear wrote it  
***/
import java.util.*;
public class TopK
{
        //assuming k is 5
	int k=5; 
        int[] numbers;

	public TopK()
	{
		numbers = new int[k];
		for(int i=0; i< numbers.length; i++)
                {

                   numbers[i]=0;
                }
	}
	public void insert(int n)
	{
		//sort the arrays in ascending order
		Arrays.sort(numbers);
		for(int i=0; i<=numbers.length; i++)
                {
			if(n>numbers[i])
                            
                        numbers[i]=n;
                            break;      
                }
	}
        public void print()
        {
            for(int i=0; i<numbers.length; i++)
                    System.out.println(numbers[i]);
        }
          public static void main(String[] args)
          {
              TopK tp = new TopK();
              //Here you will read @ekt_bear 1 Zillion numbers and insert them individually e.g tp.insert(read.nextInt)
              //but for sake of convinience i will just insert some numbers to test it
               tp.insert(90);
               tp.insert(40);
               tp.insert(100);
               tp.insert(60);
               tp.insert(10);
               tp.insert(80);
               tp.insert(110);
               tp.insert(1000);
               tp.insert(260);
               tp.insert(10);
               tp.print();
          }

}

goon: U be heavy mumu...

informatix: I am a programmer infact one of the Best in Nigeria. I learn how to program with a Laptop whose power doesnt Last for 1munite. I strongly DON'T agree power is a boundary in leraning programming.
A serious programmer should be able to know where to get 24hours light.cafe,bizcenter,govt. Office. I once travelled 150km to get a condusive environment to Start Apache tomcat version4 using java virtual machine.


import java.io.*;

class naija{
public Static void main(String args[]){
public String ans;
Bufferedreader input=new Bufferedreader(New Inputstreamreader(System.read());
System.out.print("I dont believe power shortage is a boundary to learning how to program";

System.out.print("what do u think?";
ans=input.readLine();
System.out.println(" you said"+ans);
}}

compile=javac naija.java
execute=java naija

spikes C: research on Erlang, am on mobile, should have wrote you a comprehensive answer. and No, its not embedded on the web application. It runs seperately, i've don a very deep research on it. i even have an e-book they wrote on it.

toba: thats the problem. who told u madrid is the 2nd best team in the world? pls stop spreading false stat. when last did this ur madrid played in the UCL final? whats their position on the table for this season's laliga? whats the source of this info?

toba: I know Barca. that team from spain that plays all passing game, yet couldnt beat Madrid in the first el classico with iniesta, xavi, pedro, messi.

CFCfan: Real Madrid made history tonight. They are the first team to score in 17 consecutive Champions League matches.

toba: Dortmund is just too big for madrid. barca sef. go try but cant beat dortmund over two legs