if (ra == ReorganizingAlgorithm.COUNT) {

			ListItem<T> item = head;
			item.counter = 0;
			while (item.next != null) {
				if (predicate.test(item.next.key)) {
					item.counter++;
				}

				if (head.next.counter > head.counter) {

					System.out.println("hier");

					ListItem<T>tmpItem = item;
					ListItem<T>tmpNext = item.next;

					tmpItem.next = item.next.next;
					tmpNext.next = head;
					head = tmpNext;

				//break;



				}
				item = item.next;
			} // end while

		}