package dk.itu.oop.lecture5;

public class Exercises{
	public static void main(String[] args){
		//System.out.println("Kasper".startsWith(null));
		String haddock = "You #!@ Miserable earthworms! Numbskulls! and Carpet-sellers!";
		toWords(haddock);
		System.out.println("----------");
		WordIterator itr = new WordIterator(haddock);
		while (itr.hasNext()) System.out.println(itr.next());
		System.out.println("----------");
		int[] a ={3,6,7,3,8,1,2,5};
		bubbleSort1(a);
		for( int i=0; i<a.length;i++)
			System.out.print(a[i]+" ");
		System.out.println();
		System.out.println("----------");
		a = new int[]{3,6,7,3,8,1,2,5};
		bubbleSort2(a);
		for( int i=0; i<a.length;i++)
			System.out.print(a[i]+" ");

		System.out.println();

	}

	static void toWords(String str){
		int i = 0;
		final int N = str.length();
		// skip leading non letters
		while (i<N && !Character.isLetter(str.charAt(i)))
			i++;
		while (i<N){
			// print the word
			while (i<N && Character.isLetter(str.charAt(i))){
				System.out.print(str.charAt(i));
				i++;
			}
			System.out.println();
			// skip non letters
			while (i<N && !Character.isLetter(str.charAt(i))){
				i++;
			}
		}

	}
	static void bubbleSort1(int[] a){
		int i = a.length;
		// inv: the elements in a between i and a.length-1 are sorted
		// and all elements between i and a.length are larger than
		// all elements between 0 and i-1.
		while (0<i){
			int j=0;
			//inv: all elements from 0..j-1 are less than the j. element
			while (j<i-1){
				j++;
				if (a[j-1]>a[j]){
					int tmp = a[j];
					a[j]=a[j-1];
					a[j-1]=tmp;
				}
			}
			i--;
		}
	}

	static void bubbleSort2(int[] a){
		boolean sorted=false;
		// sorted iff a is sorted
		while (!sorted){
			sorted=true;
			// inv: sorted iff a is sorted from 0 to j-1
			for (int j = 1; j<a.length;j++){
				if (a[j-1]>a[j]){
					int tmp = a[j];
					a[j]=a[j-1];
					a[j-1]=tmp;
					sorted=false;
				}
			}
		}
	}
}

class WordIterator implements OOPIterator{
	// inv: if nextWord.size() = 0, the iterator is empty
	//      else nextWord is the head.
	//      i is either N or the first unprocessed letter in str
	//      N is the length of str.
	final String str;
	final int N;
	int i;
	String nextWord;
	WordIterator(String str){
		this.str= str;
		i=0;
		N = str.length();
		findNext();
	}
	private void findNext(){
		// skip non letters
		while( i<N && !Character.isLetter(str.charAt(i)) )
			i++;
		// find the word
		int start = i;
		while( i<N && Character.isLetter(str.charAt(i)) )
			i++;
		nextWord = str.substring(start,i);
	}

	public boolean hasNext(){
		return nextWord.length()>0;
	}

	public Object peek(){
		return nextWord;
	}

	public Object next(){
		String ret = nextWord;
		findNext();
		return ret;
	}

	public OOPIterator cloneMe(){
		try{
			return (OOPIterator)super.clone();
		}catch(Exception shouldNotHappen){
			return null;
		}
	}
}