Scala: how can I sort an array of tuples by their second element?

ArraysScalaSortingTuples

Arrays Problem Overview


is there a way in Scala to sort an array of tuples using and arbitrary comparison function? In particular I need to sort and array of tuples by their second element, but I wanted to know a general technique to sort arrays of tuples.

Thanks!

Arrays Solutions


Solution 1 - Arrays

In scala 2.8, there is a method sortBy. Here is a simple use case:

scala> val arr = Array(("One",1),("Two",2),("Four",4),("Three",3))
arr: Array[(java.lang.String, Int)] = Array((One,1), (Two,2), (Four,4), (Three,3))

scala> arr.sortBy(_._2)
res0: Array[(java.lang.String, Int)] = Array((One,1), (Two,2), (Three,3), (Four,4))

scala>

Solution 2 - Arrays

You can use this code:

scala> val v = Array(('a', 2), ('b', 1))
v: Array[(Char, Int)] = Array((a,2), (b,1))

scala> scala.util.Sorting.stableSort(v,
     | (e1: (Char, Int), e2: (Char, Int)) => e1._2 < e2._2)

scala> v
res11: Array[(Char, Int)] = Array((b,1), (a,2))

Unfortunetly, it seems that Scala cannot infer the type of the array passed to stableSort. I hope that's ok for you.

Solution 3 - Arrays

If it's an Array, it's probably typical to use in-place sorting algorithms. However, in idiomatic Scala code, mutable collections are usually not encouraged/used. If that's the case and you have am immutable collection (or would like to not modify the Array in place), use sortWith:

scala> val a = Array(1, 3, 2, 5)
a: Array[Int] = Array(1, 3, 2, 5)

scala> a.sortWith(_ > _)
res6: Array[Int] = Array(5, 3, 2, 1)

scala> a
res7: Array[Int] = Array(1, 3, 2, 5)

sorting an Array or any other collection of tuples:

scala> val a = Array(('a', 1), ('b', 4), ('c', 5), ('d', 2))
a: Array[(Char, Int)] = Array((a,1), (b,4), (c,5), (d,2))

scala> a.sortWith(_._2 > _._2)
res4: Array[(Char, Int)] = Array((c,5), (b,4), (d,2), (a,1))

scala> a
res5: Array[(Char, Int)] = Array((a,1), (b,4), (c,5), (d,2))

Solution 4 - Arrays

On Scala 2.8 (yes, again :), you can also do this:

val v = Array(('a', 2), ('b', 1))
scala.util.Sorting.stableSort(v)(manifest[(Char, Int)], Ordering.by(_._2))

In the specific case of pairs, this can also work to sort first by the second element, and then by the first:

scala.util.Sorting.stableSort(v)(manifest[(Char, Int)], Ordering.by(_.swap))

Solution 5 - Arrays

2.7 and not in place:

(Array((2,3), (4,2), (1,5)).toList.sort (_._2 < _._2)).toArray

Solution 6 - Arrays

You probably want def stableSort[K](a : Seq[K], f : (K, K) => Boolean) : Array[K] from scala.util.Sorting.
Your comparison function would be something like _._2 < _._1

Solution 7 - Arrays

val l = List((2, 1), (3, 2), (0, 3))
l sort { case(a, b) => a > b }

Attributions

All content for this solution is sourced from the original question on Stackoverflow.

The content on this page is licensed under the Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) license.

Content TypeOriginal AuthorOriginal Content on Stackoverflow
Questionpau.estalellaView Question on Stackoverflow
Solution 1 - ArraysEastsunView Answer on Stackoverflow
Solution 2 - ArraysMichel KrämerView Answer on Stackoverflow
Solution 3 - ArraysErik KaplunView Answer on Stackoverflow
Solution 4 - ArraysDaniel C. SobralView Answer on Stackoverflow
Solution 5 - Arraysuser unknownView Answer on Stackoverflow
Solution 6 - ArrayststennerView Answer on Stackoverflow
Solution 7 - ArraysJawherView Answer on Stackoverflow