< Summary

Information

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

Line coverage

100%

Covered lines:	21
Uncovered lines:	0
Coverable lines:	21
Total lines:	52
Line coverage:	100%

Branch coverage

100%

Covered branches:	8
Total branches:	8
Branch coverage:	100%

Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
MySqrt(...)	100%	8	8	100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\Sqrt\SqrtBinarySearch.cs

#	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.Sqrt;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public class SqrtBinarySearch : ISqrt`
	`16`	`{`
	`17`	`/// <summary>`
	`18`	`/// Time complexity - O(log x)`
	`19`	`/// Space complexity - O(1)`
	`20`	`/// </summary>`
	`21`	`/// <param name="x"></param>`
	`22`	`/// <returns></returns>`
	`23`	`public int MySqrt(int x)`
9	`24`	`{`
9	`25`	`if (x is 0 or 1)`
2	`26`	`{`
2	`27`	`return x;`
	`28`	`}`
	`29`
7	`30`	`var start = 1;`
7	`31`	`var end = x;`
7	`32`	`var ans = 0;`
	`33`
55	`34`	`while (start <= end)`
48	`35`	`{`
48	`36`	`var mid = start + ((end - start) / 2);`
	`37`
48	`38`	`if (mid <= x / mid)`
14	`39`	`{`
14	`40`	`start = mid + 1;`
	`41`
14	`42`	`ans = mid;`
14	`43`	`}`
	`44`	`else`
34	`45`	`{`
34	`46`	`end = mid - 1;`
34	`47`	`}`
48	`48`	`}`
	`49`
7	`50`	`return ans;`
9	`51`	`}`
	`52`	`}`

< Summary

Metrics

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\Sqrt\SqrtBinarySearch.cs

Methods/Properties