Easy 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 n) {
    int a = -1,e = -1;
    for(int i = 0;i<n;i++){
        if(nums[i]==1){
            a = i;
        }
        if(nums[i]==n){
            e = i;
        }
    }
    int c = (n-1)-e;
    if(a<e){
        return a+c;
    }else{
        return a+c-1;
    }    
}
```
['C']