Longest Sorted Subsequence

	def longestSortedSubSeq (listOfValues):
	    longestSeqSeen = 1
	    currentSeqLength = 1
	    current = 1
	    while (current < len(listOfValues)):
	        if (listOfValues[current] >= listOfValues[current-1]):
	            currentSeqLength = currentSeqLength + 1

	        else:
	            if (currentSeqLength > longestSeqSeen):
	                longestSeqSeen = currentSeqLength
	            currentSeqLength = 1

	        current = current + 1

	    if (currentSeqLength > longestSeqSeen):
	        longestSeqSeen = currentSeqLength

	    print longestSeqSeen