trekhleb/javascript-algorithms

Description

Summary

• ☝ Note that this project is meant to be used for learning and researching purposes only, and it is not meant to be used for production.
• More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
• Branch & Bound - remember the lowest-cost solution found at each stage of the backtracking search, and use the cost of the lowest-cost solution found so far as a lower bound on the cost of a least-cost solution to the problem, in order to discard partial solutions with costs larger than the lowest-cost solution found so far.
• npm test -- 'playground' Useful Information References Big O Notation Big O notation is used to classify algorithms according to how their running time or space requirements grow as the input size grows.