Finding the $k$th largest element in an unsorted array
Yes, there is. Selection algorithm. There are two versions: running in worst-case linear time, and in expected linear time (see Cormen's chapter 9).
You can also implement this algorithm to run in sublinear time using data structures.