no message

Author: Partho Biswas

algoexpert.io/python/Max_Path_Sum_In_Binary_Tree.py

@@ -3,7 +3,6 @@ def maxPathSum(tree):
     _, maxSum = findMaxSum(tree)
     return maxSum
 
-
 def findMaxSum(tree):
     if tree is None:
         return (0, 0)

algoexpert.io/python/Quick_Select.py

@@ -1,33 +1,25 @@
-
-
-
-def quickSelect(array, k):
+def quickselect(array, k):
     position = k - 1
-    return quickSelectHelper(array, 0, len(array) - 1, position)
-
-
-def quickSelectHelper(array, startIndex, endIndex, position):
-    while True:
-        if startIndex > endIndex:
-            raise Exception('Algorithm should never arrive here!')
-        pivotIndex = startIndex
-        leftIndex = startIndex + 1
-        rightIndex = endIndex
-        while leftIndex <= rightIndex:
-            if array[leftIndex] > array[pivotIndex] and array[rightIndex] < array[pivotIndex]:
-                swap(leftIndex, rightIndex, array)
-            if array[leftIndex] <= array[pivotIndex]:
-                leftIndex += 1
-            if array[rightIndex] >= array[pivotIndex]:
-                rightIndex -= 1
-        swap(pivotIndex, rightIndex, array)
-        if rightIndex == position:
-            return array[rightIndex]
-        elif rightIndex < position:
-            startIndex = rightIndex + 1
-        else:
-            endIndex = rightIndex - 1
-
+	return quickSelectHelper(array, 0, len(array) - 1, position)
 
-def swap(one, two, array):
-    array[one], array[two] = array[two], array[one]
+def quickSelectHelper(array, srtIdx, endIdx, position):
+	while True:
+		if srtIdx > endIdx:
+			raise Exception("Algorrithm should never be here!")
+		pivotIdx = srtIdx
+		leftIdx = srtIdx + 1
+		rightIdx = endIdx
+		while leftIdx <= rightIdx:
+			if array[leftIdx] > array[pivotIdx] > array[rightIdx]:
+				array[leftIdx], array[rightIdx] = array[rightIdx], array[leftIdx]
+			if array[leftIdx] <= array[pivotIdx]:
+				leftIdx += 1
+			if array[rightIdx] >= array[pivotIdx]:
+				rightIdx -= 1
+		array[pivotIdx], array[rightIdx] = array[rightIdx], array[pivotIdx]
+		if rightIdx == position:
+			return array[position]
+		elif rightIdx > position:
+			endIdx = rightIdx - 1
+		else:
+			srtIdx = rightIdx + 1