gistfile1.java

		class MySort {
		public static <E extends Comparable<E>> void quickSort(MyNode<E> list) {
			MyNode<E> last = list;
			while (last.next !=null && list !=null) {
				//System.out.println("yes");
				last = last.next;
			}
			System.out.println(list);
			sort(list, last); 
		}

		public static <E extends Comparable<E>> void sort(MyNode<E> head, MyNode<E> last) {
			MyNode<E> Pivot, lTail=null, rTail=null, temp, new_temp, left = null, right = null;
			temp = head;
			E pivot = head.element;
			Pivot = head;
			last.next = null;	
			//compare and place in left or right
			while(temp.next != null){
				System.out.println("*");
				temp = temp.next;
				if(temp.element.compareTo(pivot) <= 0) {
					System.out.println("yess");
					if(left == null) {
						left = temp;
						lTail=temp ;
					}else{
						new_temp = left;
						left = temp;
						left.next = new_temp;
					}
				}
				if(temp.element.compareTo(pivot) > 0) {
					System.out.println("noo");
					if(right == null) {
						right = temp;
						rTail=temp;
					}else{
						new_temp = right;
						right = temp;
						right.next = new_temp;
					}
				}
			}

			//Connect left pivot and right and recursively call function
			if(left != null && right != null){
			lTail.next=Pivot;
			Pivot.next=right;
			sort(left, lTail);
			sort(right, rTail);
			}else if (left == null & right != null){
			Pivot.next=right;
			sort(right,rTail);
			}else if (left != null & right == null){
			lTail.next=Pivot;
			sort(left,lTail);
			}
		}
	}