Simple C solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```c []
int semiOrderedPermutation(int* nums, int numsSize) {
    int pos1=0,posN=0;
    for(int i=0;i<numsSize;i++){
        if(nums[i]==1){
            pos1=i;
        }
        if(nums[i]==numsSize){
            posN=i;
        }
    }
    int swaps1=pos1;
    int swapsN=numsSize-1-posN;
     if (pos1 > posN) 
        return swaps1 + swapsN - 1;
    else 
        return swaps1 + swapsN;
}
```
['C']