O'Reilly logo

Learning Functional Data Structures and Algorithms by Raju Kumar Mishra, Atul Khot

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Drop elements

We are chugging along nicely. Let's look at element removal:

Drop elements

Here comes the method definition:

scala> :paste 
// Entering paste mode (ctrl-D to finish) 
 
  def drop[A](l: List[A], n: Int): List[A] = 
    if (n <= 0) l 
    else l match { 
      case Nil => Nil 
      case _ :: t => drop(t, n - 1) 
    } 

We drop n (or less than n) elements starting at the beginning of the list. If there are less than n elements, we return a Nil (empty) list.

What is the complexity of the drop method? It is O(n), as we might end up traversing the entire list.

The dropWhile method takes a list and predicate function. It invokes the function on successive elements and drops them if it evaluates ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required