Home | Back to Courses
Recursion, Backtracking and Dynamic Programming in Python
Partner: Udemy
Affiliate Name:
Area:
Description: This course is about the fundamental concepts of algorithmic problems focusing on recursion, backtracking, dynamic programming and divide and conquer approaches. As far as I am concerned, these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or R&D.Section 1 - RECURSIONwhat are recursion and recursive methodsstack memory and heap memory overviewwhat is stack overflow?Fibonacci numbersfactorial functiontower of Hanoi problemSection 2 - SEARCH ALGORITHMSlinear search approachbinary search algorithmSection 3 - SELECTION ALGORITHMSwhat are selection algorithms?Hoare's algorithmhow to find the k-th order statistics in O(N) linear running time?quickselect algorithmmedian of medians algorithmthe secretary problemSection 4 - BIT MANIPULATION PROBLEMSbinary numberslogical operators and shift operatorschecking even and odd numbersbit length problemRussian peasant multiplicationSection 5 - BACKTRACKINGwhat is backtracking?n-queens problemHamiltonian cycle problemcoloring problemknight's tour problemmaze problemSudoku problemSection 6 - DYNAMIC PROGRAMMINGwhat is dynamic programming?knapsack problemrod cutting problemsubset sum problemKadane's algorithm<
Category: Development > Data Science > Python
Partner ID:
Price: 199.99
Commission:
Source: Impact
Go to Course