Commit d8db2d4

committed

Three Hundred - Twenty-Four Commit: Implement insertionsort() function

1 parent 229cdf8 commit d8db2d4Copy full SHA for d8db2d4

File tree

+17

-1

lines changed

+17

-1

lines changed

Lines changed: 17 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,16 @@`
`1`	`1`	`# Bucket Sort with Hashing Function`
`2`	`2`	`# =================================`
	`3`	`+def insertionsort(A):`
	`4`	`+ n = len(A)`
	`5`	`+ for i in range(1, n):`
	`6`	`+ cvalue = A[i]`
	`7`	`+ position = i`
	`8`	`+ while position > 0 and A[position - 1] > cvalue:`
	`9`	`+ A[position] = A[position - 1]`
	`10`	`+ position = position - 1`
	`11`	`+ A[position] = cvalue`
	`12`	`+`
	`13`	`+`
`3`	`14`	`def bucketsort(A):`
`4`	`15`	`n = len(A)`
`5`	`16`	`maxelement = max(A)`
`@@ -17,4 +28,9 @@ def bucketsort(A):`
`17`	`28`	`for i in range(10):`
`18`	`29`	`for j in range(len(buckets[i])):`
`19`	`30`	`A[k] = buckets[i].pop(0)`
`20`		`- k = k + 1`
	`31`	`+ k = k + 1`
	`32`	`+`
	`33`	`+A = [63, 250, 835, 947, 651, 28]`
	`34`	`+print('Original Array: ', A)`
	`35`	`+bucketsort(A)`
	`36`	`+print('Sort Array: ', A)`

Comments

(0)