Insertion Sort With Binary Search

Insertion_Sort_With_Binary_Search.py

#! /usr/bin/env python3
import random

def BinarySearchInsertPoint(searchArray, searchKey):
	if len(searchArray) == 0:
		return 0
	middleIndex = int(len(searchArray) / 2 - 0.5)
	print(
		"Target Array",
		searchArray,
		",",
		"Insert Key:",
		searchKey,
		",",
		"Middle Index",
		middleIndex,
		"->",
		searchArray[middleIndex],
		",",
		searchArray[middleIndex],
		"<=",
		searchKey,
		":",
		searchArray[middleIndex] <= searchKey
	)
	if searchArray[middleIndex] <= searchKey:
		return middleIndex + 1 + BinarySearchInsertPoint(searchArray[middleIndex+1:], searchKey)
	else:
		return BinarySearchInsertPoint(searchArray[:middleIndex], searchKey)

def InsertionSort(sortArray):
	print("Array:", sortArray)
	for i in range(1,len(sortArray)):
		if sortArray[i-1] <= sortArray[i]:
			continue
		print("Phase", i, ":", sortArray)
		insertIndex = BinarySearchInsertPoint(sortArray[:i], sortArray[i])
		print("Insert Index:", insertIndex)
		sortArray[insertIndex],sortArray[insertIndex+1:i+1] = sortArray[i],sortArray[insertIndex:i]
		print("Result:", sortArray)
		print("===============================================================================================")
	print("Finished!")

if __name__ == '__main__':
	#sortArray = []
	#for x in range(10):
	#	sortArray.append(random.randrange(10))
	sortArray = list(range(10))
	random.shuffle(sortArray)
	InsertionSort(sortArray)