1. The time to merge a pair of lists to get an n element list is O(n)since each recursive call “retires” an
element to the result list and each element of the result gets retired only once.
2. Thus, the time to merge pairs on a list of lists, the summed total length of which is n, is O(n), since from
(1) the time to merge a single pair is proportional to the number of elements in the result.
3. The time to use
repeat on a list of n 1-element lists is the number of times repeat is called recursively
times O(n), from (2).
4. The number of times
repeat is called is ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.