< Summary

Information
Class: LeetCode.Algorithms.HowManyNumbersAreSmallerThanTheCurrentNumber.HowManyNumbersAreSmallerThanTheCurrentNumberBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\HowManyNumbersAreSmallerThanTheCurrentNumber\HowManyNumbersAreSmallerThanTheCurrentNumberBruteForce.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 46
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
SmallerNumbersThanCurrent(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\HowManyNumbersAreSmallerThanTheCurrentNumber\HowManyNumbersAreSmallerThanTheCurrentNumberBruteForce.cs

#LineLine 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
 12namespace LeetCode.Algorithms.HowManyNumbersAreSmallerThanTheCurrentNumber;
 13
 14/// <inheritdoc />
 15public class HowManyNumbersAreSmallerThanTheCurrentNumberBruteForce : IHowManyNumbersAreSmallerThanTheCurrentNumber
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int[] SmallerNumbersThanCurrent(int[] nums)
 324    {
 325        var result = new int[nums.Length];
 26
 327        var numsLength = nums.Length;
 28
 3229        for (var i = 0; i < numsLength; i++)
 1330        {
 1331            var count = 0;
 32
 14033            for (var j = 0; j < numsLength; j++)
 5734            {
 5735                if (nums[i] > nums[j])
 1536                {
 1537                    count++;
 1538                }
 5739            }
 40
 1341            result[i] = count;
 1342        }
 43
 344        return result;
 345    }
 46}