This module covers how to analyze performance of algorithms, models of computation, basic data structures, algorithm design techniques, and common sorting algorithms. [Workload: 1 Week]

Transform you career with Coursera's online Algorithm Design courses. Enroll for free, earn a certificate, and build job-ready skills on your schedule. Join today!

This course is about the design and analysis of algorithms. We study specific algorithms for a variety of problems, as well as general design and analysis techniques. Specific topics include searching, sorting, algorithms for graph problems, efficient …

In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication.

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression.

The knowledge of Algorithm teach you How to Think to solve a Problem? The algorithm is the concept that differentiates one average software engineer and one better software engineer. In our daily life in the industry, we used different kinds of algorithms to make the system faster, better, and more efficient.

This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.

Welcome to the self paced course, Algorithms: Design and Analysis! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience.

Algorithm Design and Analysis is a core computer science course focused on creating efficient methods to solve computational problems. It introduces students to fundamental design strategies such as divide and conquer, greedy algorithms, dynamic …

Gain an understanding of algorithm design technique and work on algorithms for fundamental graph problems including depth-first search, worst and average case analysis, connected components, and shortest paths.