Merge Sort Demo volunteers by Zebel -Al- Tareq

Row 4

bdzebel — 2020-11-27 13:29:51 UTC

We have 7 elements in the array.
7 // 2 = 3

Floor Example

bdzebel — 2020-11-27 13:29:51 UTC

6 // 2 = 3
7 // 2 = 3 (division is 3.5 but floor rounds up to previous rounded value which is 3)

Row 1

bdzebel — 2020-11-27 13:29:51 UTC

Row 2

bdzebel — 2020-11-27 13:29:51 UTC

Row 3

bdzebel — 2020-11-27 13:29:51 UTC

Row 11

bdzebel — 2020-11-27 13:29:51 UTC

Row 5

bdzebel — 2020-11-27 13:29:51 UTC

Row 6

bdzebel — 2020-11-27 13:29:51 UTC

Row 7

bdzebel — 2020-11-27 13:29:51 UTC

Row 8

bdzebel — 2020-11-27 13:29:51 UTC

Row 9

bdzebel — 2020-11-27 13:29:51 UTC

Row 10

bdzebel — 2020-11-27 13:29:51 UTC

id 1

bdzebel — 2020-11-27 13:29:51 UTC

id 2

bdzebel — 2020-11-27 13:29:51 UTC

id 3

bdzebel — 2020-11-27 13:29:51 UTC

id 6

bdzebel — 2020-11-27 13:29:51 UTC

id 7

bdzebel — 2020-11-27 13:29:51 UTC

id 5

bdzebel — 2020-11-27 13:29:51 UTC

id 4

bdzebel — 2020-11-27 13:29:51 UTC

Row 12

bdzebel — 2020-11-27 13:29:51 UTC

Code For Merge Sort

bdzebel — 2020-11-27 13:29:51 UTC

While loop incremental

bdzebel — 2020-11-27 13:29:51 UTC

i = 0
while i < = 5:
print(i)
i = i + 1
# loop will print 0,1,2,3,4,5 and then break

While loop decremental

bdzebel — 2020-11-27 13:29:51 UTC

i = 5
while 0 < = i:
print(i)
i = i - 1
# loop will print 5,4,3,2,1,0 and then break

7 // 2 = 3

bdzebel — 2020-11-27 14:08:18 UTC

i = 3(left)
j = 4 (right)
k = 7 (always)

4 // 2 = 2

bdzebel — 2020-11-27 14:09:17 UTC

i = 2(left)
j = 2 (right)
k = 4 (always)