C# || How To Sort An Array By Parity Using C#

The following is a module with functions which demonstrates how to sort an array by parity using C#.

1. Sort Array By Parity – Problem Statement

Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers.

Return any array that satisfies this condition.

Example 1:

``` Input: nums = [3,1,2,4] Output: [2,4,3,1] Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted. ```

Example 2:

``` Input: nums = [0] Output: [0] ```

2. Sort Array By Parity – Solution

The following is a solution which demonstrates how to sort an array by parity.

``` 2. Sort Array By Parity - Solution C# // ============================================================================ // Author: Kenneth Perkins // Date: Dec 1, 2023 // Taken From: http://programmingnotes.org/ // File: Solution.cs // Description: Demonstrates how to sort an array by parity // ============================================================================ public class Solution { public int[] SortArrayByParity(int[] nums) { var startIndex = 0; var endIndex = nums.Length -1; while (startIndex < endIndex) { if (IsOdd(nums[startIndex])) { var temp = nums[startIndex]; nums[startIndex] = nums[endIndex]; nums[endIndex] = temp; --endIndex; } else { ++startIndex; } } return nums; } private bool IsOdd(int num) { return num % 2 != 0; } }// http://programmingnotes.org/ 1234567891011121314151617181920212223242526272829 // ============================================================================//    Author: Kenneth Perkins//    Date:   Dec 1, 2023//    Taken From: http://programmingnotes.org///    File:  Solution.cs//    Description: Demonstrates how to sort an array by parity// ============================================================================public class Solution {    public int[] SortArrayByParity(int[] nums) {        var startIndex = 0;        var endIndex = nums.Length -1;         while (startIndex < endIndex) {            if (IsOdd(nums[startIndex])) {                var temp = nums[startIndex];                nums[startIndex] = nums[endIndex];                nums[endIndex] = temp;                --endIndex;            } else {                ++startIndex;            }        }        return nums;    }     private bool IsOdd(int num) {        return num % 2 != 0;    }}// http://programmingnotes.org/ ```

QUICK NOTES:
The highlighted lines are sections of interest to look out for.

The code is heavily commented, so no further insight is necessary. If you have any questions, feel free to leave a comment below.

Once compiled, you should get this as your output for the example cases:

``` [4,2,1,3] [0] ```