xava-dev / algorithm-highest-product Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Algorithm that returns the highest product between three numbers of a given array of integers. I have developed two approaches which take time and space complexity into account.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
README.md		README.md
highestProduct.js		highestProduct.js

Repository files navigation

Algorithm Highest / Max Product

Algorithm that returns the highest product between three numbers of a given array of integers.

I have developed two approaches which take time and space complexity into account.

Approach 1

Time Complexity: O(n)
Space Complexity: O(n)

Approach 2

Time Complexity: O(n + k)
Space Complexity: O(k)

About

Algorithm that returns the highest product between three numbers of a given array of integers. I have developed two approaches which take time and space complexity into account.

javascript algorithm data-structures big-o time-complexity algorithms-and-data-structures counting-sort space-complexity max-product counting-sort-algorithm

Report repository

Releases

No releases published

Packages

No packages published

Languages

JavaScript 100.0%