<p>I've been studyin' the <a href="http://en.wikipedia.org/wiki/Spearman%27s_rank_correlation_coefficient" rel="nofollow">Spearman's rank correlation coefficient</a>.
If computed for two list that have both size $N$, what's the complexity of the algorithm?</p>

<p>$O(N)$ ?</p>

<p>Thanks in advance.</p>

CC BY-SA 3.0
2012-07-03T16:05:29.530Z
Technically you need to sort it first. Btw this question might be better off at cs.stackexchange.com
Suresh Venkat
CC BY-SA 3.0
2015-05-07T00:01:35.870Z
This question was [cross-posed to CS.SE](http://cs.stackexchange.com/q/2604/55) where it was answered. Next time please ask the moderators to migrate your question instead of multiple posts that splinter conversation.
Artem Kaznatcheev
<cc.complexity-theory><counting-complexity><time-complexity>
What's the complexity of Spearman's rank correlation coefficient computation?
DavideChicco.it
# What's the complexity of Spearman's rank correlation coefficient computation?

(Asked by: username_0 on 2012-07-03)

I've been studyin' the [Spearman's rank correlation coefficient](http://en.wikipedia.org/wiki/Spearman%27s_rank_correlation_coefficient).
If computed for two list that have both size $N$, what's the complexity of the algorithm?

$O(N)$ ?

Thanks in advance.

**Tags:** cc.complexity-theory, counting-complexity, time-complexity

> **Comments:**
> **username_1**: Technically you need to sort it first. Btw this question might be better off at cs.stackexchange.com  
> **username_2**: This question was [cross-posed to CS.SE](http://cs.stackexchange.com/q/2604/55) where it was answered. Next time please ask the moderators to migrate your question instead of multiple posts that splinter conversation.  

---

## 0 answers

