Ordering, a Scala language concept

Last updated

In Scala, the 'Ordering' type is a 'type class' that contains methods to determine an ordering of specific types.

assert(List(3, 2, 1).sorted == List(1, 2, 3))

assert(List(3, 2, 1).sorted(Ordering[Int].reverse) == List(3, 2, 1))

assert(Ordering[Int].lt(1, 2))

assert(!Ordering[Int].lt(2, 1))

Custom orderings can be created and composed

The 'Ordering' type class is very powerful because complex orderings can be achieved from small parts, and they can even be context-specific.

final case class Person(name: String, height: Int)

val people: List[Person] = List(
  Person("Ann", height = 176),
  Person("Thomas", height = 175),
  Person("Judy", height = 173)

implicit val personOrdering: Ordering[Person] =
  Ordering.by((_: Person).height)

assert(people.sorted.map(_.name) == List("Judy", "Thomas", "Ann"))

assert(people.sortBy(_.name).map(_.name) == List("Ann", "Judy", "Thomas"))

people.sortBy(person => (person.height, person.name))

To learn more about Type Classes go to: Type Class.

Scala Algorithms: The most comprehensive library of algorithms in standard pure-functional Scala

Think in Scala & master the highest paid programming language in the US

Scala is used at many places, such as AirBnB, Apple, Bank of America, BBC, Barclays, Capital One, Citibank, Coursera, eBay, JP Morgan, LinkedIn, Morgan Stanley, Netflix, Singapore Exchange, Twitter.

Study our 106 Scala Algorithms: 6 fully free, 60 published & 46 upcoming

Fully unit-tested, with explanations and relevant concepts; new algorithms published about once a week.

  1. Compute the length of longest valid parentheses
  2. Monitor success rate of a process that may fail
  3. Find combinations adding up to N (unique)
  4. Find k closest elements to a value in a sorted Array
  5. Make a queue using stacks (Lists in Scala)
  6. Single-elimination tournament tree
  7. Quick Sort sorting algorithm in pure immutable Scala
  8. Find minimum missing positive number in a sequence
  9. Compute a Roman numeral for an Integer, and vice-versa
  10. Matching parentheses algorithm with foldLeft and a state machine
  11. Traverse a tree Breadth-First, immutably
  12. Read a matrix as a spiral
  13. Remove duplicates from a sorted list (state machine)
  14. Merge Sort: stack-safe, tail-recursive, in pure immutable Scala, N-way
  15. Longest increasing sub-sequence length
  16. Binary search a generic Array
  17. Merge Sort: in pure immutable Scala
  18. Make a queue using Maps
  19. Is an Array a permutation?
  20. Count number of contiguous countries by colors
  21. Add numbers without using addition (plus sign)
  22. Tic Tac Toe MinMax solve
  23. Run-length encoding (RLE) Encoder
  24. Print Alphabet Diamond
  25. Balanced parentheses algorithm with tail-call recursion optimisation
  26. Reverse a String's words efficiently
  27. Count number of changes (manipulations) needed to make an anagram with foldLeft and a MultiSet
  28. Count passing cars
  29. Counting inversions of a sequence (array) using a Merge Sort
  30. Check if an array is a palindrome
  31. Compute nth row of Pascal's triangle
  32. Run-length encoding (RLE) Decoder
  33. Check if a number is a palindrome
  34. In a range of numbers, count the numbers divisible by a specific integer
  35. Find the index of a substring ('indexOf')
  36. Reshape a matrix
  37. Closest pair of coordinates in a 2D plane
  38. Find the contiguous slice with the minimum average
  39. Compute maximum sum of subarray (Kadane's algorithm)
  40. Binary search in a rotated sorted array
  41. Rotate Array right in pure-functional Scala - using an unusual immutable efficient approach
  42. Length of the longest common substring
  43. Tic Tac Toe board check
  44. Find an unpaired number in an array
  45. Check if a String is a palindrome
  46. Count binary gap size of a number using tail recursion
  47. Remove duplicates from a sorted list (Sliding)
  48. Find sub-array with the maximum sum
  49. Find the minimum absolute difference of two partitions
  50. Find maximum potential profit from an array of stock price
  51. Fibonacci in purely functional immutable Scala
  52. Fizz Buzz in purely functional immutable Scala
  53. Find combinations adding up to N (non-unique)
  54. Remove duplicates from an unsorted List
  55. Count factors/divisors of an integer
  56. Compute single-digit sum of digits
  57. Traverse a tree Depth-First
  58. Reverse bits of an integer
  59. QuickSelect Selection Algorithm (kth smallest item/order statistic)
  60. Rotate a matrix by 90 degrees clockwise

Explore the 21 most useful Scala concepts

To save you going through various tutorials, we cherry-picked the most useful Scala concepts in a consistent form.

  1. Class Inside Class
  2. Class Inside Def
  3. Collect
  4. Def Inside Def
  5. Drop, Take, dropRight, takeRight
  6. foldLeft and foldRight
  7. For-comprehension
  8. Lazy List
  9. Option Type
  10. Ordering
  11. Partial Function
  12. Pattern Matching
  13. Range
  14. scanLeft and scanRight
  15. Sliding / Sliding Window
  16. Stack Safety
  17. State machine
  18. Tail Recursion
  19. Type Class
  20. View
  21. Zip

Register now (free)