Find 2nd Largest Algorithm

	def findLargest(listNum, start):
	    listSize = len(listNum)
	    largestSoFar = listNum[start]
	    largestIndex = start
	    current = start + 1
	    while (current < listSize):
	        if (listNum[current] > largestSoFar):
	            largestSoFar = listNum[current]
	            largestIndex = current
	        current = current + 1
	    return (largestIndex)
	
	def find2Largest(listNum):
		biggestPosition = findLargest(listNum, 0)
		temp = listNum[biggestPosition]
		listNum[biggestPosition] = listNum[0]
		listNum[0] = temp
		biggestPosition = findLargest(listNum, 1)
		print (listNum[biggestPosition])