Now the first step is it scans the given array and blocks the elements that are already sorted in ascending order, otherwise it will be blocked as one element. After every pass, it scans if a new block can be formed, for example, if we move [4] between [2,3] and [1] then we will now be having [2,3] [4] [1], we can now see that [2,3] and [4] can be blocked as one. . Then the next step is it moves the elements until it is in the right place. In block sorting algorithm, the numbers are sorted through blocking. We will repeat all the steps until only one block is left after which the arrays are now