algorithmgoogle-sheetsstatisticsgoogle-sheets-formulaarray-formulas
How can I find the number of concordant/discordant pairs for a given cell in Google Sheets?
I am trying to figure out the Kendall's Tau coefficient of two different rankings in google sheets, and doing so would require finding the number of concordant and discordant pairs for a given cell. The number of concordant pairs for a given cell is the number of cells containing a larger number underneath the given cell, and the number of discordant pairs is the amount of smaller numbers beneath the cell. I am trying to figure out how to write a formula in google sheets (without using the API) that determines the number of concordant or discordant pairs that exist beneath a given cell. How can I accomplish this?
Solution
C2 cell:
=ARRAYFORMULA(SUM(IFERROR(IF(A1:A<A2:A, 1, 0))))
D2 cell:
=ARRAYFORMULA(SUM(IFERROR(IF(A1:A>A2:A, 1, 0))))
- Checking if a word in string contains a palindrome
- The simplest way to write a unit conversion program
- Isn't there any more efficient solution for the CodeForces 919-B/Perfect Number question?
- What's the difference between O(n) and O(n+n^1/2) in algorithm?
- Understanding dynamic programming timeouts with 2 different solutions
- ColdFusion - What's an efficient way to search an array of structs?
- Bubble sort does not sort as expected
- DirectoryInfo.EnumerateFiles(...) causes UnauthorizedAccessException (and other exceptions)
- How can I find the number of concordant/discordant pairs for a given cell in Google Sheets?
- Fastest algorithm for filling overlapping rectangles of pixels
- How to sort with incomplete ordering?
- Fast CRC algorithm?
- Extract the closest two numbers that multiply to create a given number
- Best algorithm for delete duplicates in array of strings
- Understanding the Time Complexity Difference of Two Ways to Generate Subsets
- Online algorithm for calculating standard deviation of counts
- Calculate Time Remaining
- Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
- Search Algorithm to find the k lowest values in a list (selection algorithm/problem)
- While finding count of points inside some shape using KD-Tree, do we need to check areas intersection, or just compare depth-appropriate properties?
- How to store items in the LIFO stack in a cache-friendly manner?
- What is the time complexity of heapq.nlargest?
- Shell Sort not Swapping Elements Correctly
- Linear time algorithm for computing radius of membership hyper-sphere
- How can I check Hamming Weight without converting to binary?
- Efficient Merge sort implementation in python
- algorithm to detect pools of 0s in a matrix
- how can i make my sklearn prediction model better?
- Is O(log n) always faster than O(n)
- How can I build a directory tree from a list of paths?