Recursion and Running Times
(2017, original release: 2016)

Nonfiction

eCourse

Provider: Kanopy

Details

PUBLISHED
The Great Courses, 2016
[San Francisco, California, USA] : Kanopy Streaming, 2017
DESCRIPTION

1 online resource (streaming video file) (33 minutes): digital, .flv file, sound

ISBN/ISSN
1349914
LANGUAGE
English
NOTES

Title from title frames

Expand your study of algorithms to cover recursion, one of the most fascinating ideas in computer science. Apply recursion to form a pair of sorting algorithms. Then see how another approach, iteration, excels at tasks that take too long with recursion, such as calculating the Fibonacci sequence

In Process Record

Film

Originally produced by The Great Courses in 2016

Mode of access: World Wide Web

In English

Additional Credits