Search Insert Position

public class Solution {
    public int SearchInsert(int[] nums, int target) {
        int num = 0;
            for (int i = 0; i < nums.Length; i++)
            {
                if (target <= nums[i])
                {
                    break;
                }
                num++;
            }
            return num;
    }
}