Removed superfluous code

sorting.py

 	while interval > 0:
 		# Process repeats for each value between 1 -> interval
 		for i in range(0, interval):
-			# Starting index determines initial portion of the array that is sorted
-			sortedIndex = i
 			# Process repeats as long as the current value being considered is greater than the value to its left
 			# Being greater than the value to its left means that it is not in the correct location
 			j = i