<h2 id="heading-url">URL</h2>
<a target="_blank" href="https://leetcode.com/problems/sort-an-array/description/?envType=daily-question&amp;envId=2024-07-25">Sort an Array - LeetCode</a>
<h2 id="heading-code">Code</h2>
<a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202407/sort_an_array/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202407/sort_an_array/main.fsx</a>
<pre><code class="lang-fsharp">let rec sortArray (nums: int list) : int list =
 let rec merge left right acc =
 match left, right with
 | [], [] -&gt; List.rev acc
 | h :: t, [] -&gt; merge t [] (h :: acc)
 | [], h :: t -&gt; merge [] t (h :: acc)
 | h1 :: t1, h2 :: t2 -&gt;
 if h1 &lt;= h2 then
 merge t1 right (h1 :: acc)
 else
 merge left t2 (h2 :: acc)

 match nums with
 | [] -&gt; []
 | _ :: [] -&gt; nums
 | _ -&gt;
 let mid = (List.length nums) / 2
 let left = sortArray (List.take mid nums)
 let right = sortArray (List.skip mid nums)
 merge left right []
</code></pre>

## URL

[Sort an Array - LeetCode](https://leetcode.com/problems/sort-an-array/description/?envType=daily-question&envId=2024-07-25)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202407/sort\_an\_array/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202407/sort_an_array/main.fsx)

```fsharp
let rec sortArray (nums: int list) : int list =
 let rec merge left right acc =
 match left, right with
 | [], [] -> List.rev acc
 | h :: t, [] -> merge t [] (h :: acc)
 | [], h :: t -> merge [] t (h :: acc)
 | h1 :: t1, h2 :: t2 ->
 if h1 <= h2 then
 merge t1 right (h1 :: acc)
 else
 merge left t2 (h2 :: acc)

 match nums with
 | [] -> []
 | _ :: [] -> nums
 | _ ->
 let mid = (List.length nums) / 2
 let left = sortArray (List.take mid nums)
 let right = sortArray (List.skip mid nums)
 merge left right []
```

LeetCode 912. Sort an Array in F#

URL

Code