is one of the best algorithms to truly understand sorting logic, cause it works exactly like how humans sort cards in their hand. Human way to understand: Imagine you're holding cards: 👉🏽You pick one card at a time 👉🏽You insert it into the correct position among the already sorted cards Left side = sorted, Right side = unsorted Think of it like this: I take the next element and slide it left until it reaches its correct position. No swapping neighbors again & again like bubble sort instead, we shift elements.

Step 1: i = 1 Sorted part: [3] key = 2 Compare: 3 > 2—Shift 3 right [2, 3, 4, 1] Step 2: i = 2 Sorted part: [2, 3] key = 4 4 is already in correct place - no change Step 3: i = 3 Sorted part: [2, 3, 4] Key: 1 Shift all larger element > [1,2,3,4]

Here in my own word I understand in this way; You are given an integer list of array then, you scan all numbers in your minds. At the first this question have to come to your mind. You look at the elements, then you pick out the smallest numbers then compare with the first position(index). Then you swap them together. this process is repeatedly goes through the logic until order(sorting) satisfied.

given a list for array numbers: [3, 2, 4, 1] what we've to do is by using selection sort and sort the numbers.

For instance: look at the following.
[5, 2, 4, 1]
Divide
[5, 2] [4, 1]
Divide again
[5] [2] [4] [1]
Merging sort happens here👇
[2, 5] [1, 4]
Final merge
[1, 2, 4, 5]

def merge(left, right):
result = []
i = 0
j = 0

# Compare elements from both arrays
while i < len(left) and j < len(right):
if left[i] <= right[j]:
result.append(left[i])
i += 1
else:
result.append(right[j])
j += 1

# Add remaining elements
result.extend(left[i:])
result.extend(right[j:])

return result