2hrs
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * @param {number[]} nums\n * @return {number}\n */\nvar semiOrderedPermutation = function (nums) {\n  let counter = 0\n  while (nums[0] !== 1) {\n    for (let i = 0; i < nums.length; i++) {\n      if (nums[i + 1] == 1) {\n        const temp = nums[i];\n        nums[i] = nums[i + 1];\n        nums[i + 1] = temp;\n        counter++\n      }\n    }\n  }\n\n  while (nums[nums.length - 1] !== nums.length) {\n    for (let i = 0; i < nums.length; i++) {\n      if(nums[i-1] == nums.length) {\n        const temp = nums[i];\n        nums[i] = nums[i-1];\n        nums[i-1] = temp;\n        counter++\n      }\n    }\n  }\n\n  return counter\n};\n```
['JavaScript']