Method mergesort

java/Chapter 3/Question3_6/Question.java:9–58

(Stack<Integer> inStack)

public class Question {
	static int c = 0;
	public static Stack<Integer> mergesort(Stack<Integer> inStack) {
		if (inStack.size() <= 1) {
			return inStack;
		}

		Stack<Integer> left = new Stack<Integer>();
		Stack<Integer> right = new Stack<Integer>();
		int count = 0;
		while (inStack.size() != 0) {
			count++;
			c++;
			if (count % 2 == 0) {
				left.push(inStack.pop());
			} else {
				right.push(inStack.pop());
			}
		}

		left = mergesort(left);
		right = mergesort(right);

		while (left.size() > 0 || right.size() > 0)
		{
			if (left.size() == 0)
			{
				inStack.push(right.pop());
			}
			else if (right.size() == 0)
			{
				inStack.push(left.pop());
			}
			else if (right.peek().compareTo(left.peek()) <= 0)
			{
				inStack.push(left.pop());
			}
			else
			{
				inStack.push(right.pop());
			}
		}

		Stack<Integer> reverseStack = new Stack<Integer>();
		while (inStack.size() > 0)
		{
			c++;
			reverseStack.push(inStack.pop());
		}

		return reverseStack;
	}
	
	public static Stack<Integer> sort(Stack<Integer> s) {
		Stack<Integer> r = new Stack<Integer>();