Skip to content

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 into pieces and solve the…

Notifications You must be signed in to change notification settings

kumaraswins/Coursera-Algorithm-Toolbox

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Coursera Algorithm Toolbox

The basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming.

Maximum Pairwise Product

Given the array find the 2 maximum number in an array and get the product of the array

Output

JS - Max time used: 0.06/5.00, max memory used: 34283520/536870912.

Python - Max time used: 0.10/5.00, max memory used: 26763264/536870912.


Extras

To find the min and max of 2 numbers

max(a,b) => a  if a >= b else b
Python difference between / & //
Python 3, they made the / operator do a floating-point division, and added the // operator to do integer division (i.e. quotient without remainder); whereas in Python 2, the / operator was simply integer division, unless one of the operands was already a floating point number.

About

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 into pieces and solve the…

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published