There are two different types of operations that can be performed.
Swap - swap any two elements of the array
Insertion - Move one element to any given position in the array

What is the minimum number of operations to sort a given array?

Eg. [1,2, 3, 0]
Ans: 1
Insert 0 at the beginning to form [0, 1, 2, 3]

Eg. [7, 5, 0]
Ans: 1
Swap the first and last element to form [0, 5, 7]

Any approaches to this question would be helpful.