< Summary

Information

Class:	LeetCode.Algorithms.NeitherMinimumNorMaximum.NeitherMinimumNorMaximumUsingSorting
Assembly:	LeetCode
File(s):	D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NeitherMinimumNorMaximum\NeitherMinimumNorMaximumUsingSorting.cs

Line coverage

100%

Branch coverage

100%

Method coverage

Feature is only available for sponsors

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
FindNonMinOrMax(...)	100%	2	2	100%

#	Line	Line coverage
	`1`	`// --------------------------------------------------------------------------------`
	`2`	`// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).`
	`3`	`// All Rights Reserved.`
	`4`	`// --------------------------------------------------------------------------------`
	`5`	`// This software is the confidential and proprietary information of Eugene Eremeev`
	`6`	`// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not`
	`7`	`// disclose such Confidential Information and shall use it only in accordance with`
	`8`	`// the terms of the license agreement you entered into with Eugene Eremeev (also`
	`9`	`// known as Yevhenii Yeriemeieiv).`
	`10`	`// --------------------------------------------------------------------------------`
	`11`
	`12`	`namespace LeetCode.Algorithms.NeitherMinimumNorMaximum;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public class NeitherMinimumNorMaximumUsingSorting : INeitherMinimumNorMaximum`
	`16`	`{`
	`17`	`/// <summary>`
	`18`	`/// Time complexity - O(n log n)`
	`19`	`/// Space complexity - O(1)`
	`20`	`/// </summary>`
	`21`	`/// <param name="nums"></param>`
	`22`	`/// <returns></returns>`
	`23`	`public int FindNonMinOrMax(int[] nums)`
4	`24`	`{`
4	`25`	`if (nums.Length < 3)`
1	`26`	`{`
1	`27`	`return -1;`
	`28`	`}`
	`29`
3	`30`	`Array.Sort(nums);`
	`31`
3	`32`	`return nums[1];`
4	`33`	`}`
	`34`	`}`