83
edits
Changes
Jump to navigation
Jump to search
Line 22:
Line 22: − + − :for index in range(1,len(alist)):+ − : :currentvalue = alist[index]+ − : :position = index+ − : :while position>0 and alist[position-1]>currentvalue:+ − : : :alist[position]=alist[position-1]+ − : : :position = position-1+ − : :alist[position]=currentvalue+ + + − + − + − +
no edit summary
{|
{|
def insertionSort(alist):
|+ Python Insertion Sort Example 1
|-
|def insertionSort(alist):
| :for index in range(1,len(alist)):
| : :currentvalue = alist[index]
| : :position = index
| : :while position>0 and alist[position-1]>currentvalue:
| : : :alist[position]=alist[position-1]
| : : :position = position-1
| : :alist[position]=currentvalue
alist = [54,26,93,17,77,31,44,55,20]
|alist = [54,26,93,17,77,31,44,55,20]
insertionSort(alist)
|insertionSort(alist)
print(alist)
|print(alist)
|}
|}
=== Which Algorithms Are Best Suited for Which Tasks ===
=== Which Algorithms Are Best Suited for Which Tasks ===