Searching

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem [...]

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).

This course introduces the broader discipline of computer science to people having basic familiarity with Java programming. It covers the second half of our book Computer Science: An Interdisciplinary Approach (the first half is covered in our Coursera course Computer Science: Programming with a Purpose, to be [...]

Take your Python skills further in this online course, guided by the Raspberry Pi Foundation and supported by Google. On this course, you’ll explore Python programming at an intermediate level. You’ll discover how to break down problems into smaller parts, and then design and apply algorithms to data. You’ll [...]

Improve your online research skills and your ability to critically analyse sources of information. In this course, you’ll explore the rich and diverse range of information available to you online, how to use search tools effectively, and the ways in which you can begin to assess information that you [...]