Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Add to Favourites
1 1 1 1 1
Price: 9179 EUR 9179 EUR
Contact Stanford University

More details about the program

Description

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).

Specific details

Category of Education Computer Sciense and IT

University

Stanford University

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

This course will introduce the learner to the basi ...
Processing information is the hallmark of all mode ...
A data product is the production output from a sta ...
This class is offered as CS6250 at Georgia Tech wh ...

 

©2023 EDUCOM NET. All Rights Reserved.

If you find an inaccuracy or you have comments on the description of the university or program - please let us know info@educom.net