The Hamming Distance Implementation in Javascript
The Hamming Distance is the number of different symbols between two strings/numbers (equal length). It can be also considered as the number of changes required to convert from one …
Category: algorithms
Algorithms Series: 0/1 BackPack – Dynamic Programming and BackTracking
April 22, 2018
algorithms, c / c++, dynamic programming, Dynamic Programming, Knapsack Problems, math
No Comments
Given n items with size A (i from 0 to n – 1), an integer m denotes the size of a backpack. How full you can fill this backpack? …
Data Structures and Algorithms Series – Majority Number (Boyer–Moore majority vote algorithm)
Given an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it in O(n) time and O(1) …
Simple but Powerful Simulated Annealing NPM Library (with Demo)
Simulated Annealing is a general-purpose meta heuristic optimization algorithm. It is similar to hill climbing but SA has the ability to jump out of local optimal with a decreasing …
Monte Carlo solution for Mathematics × Programming Competition #7
September 28, 2017
algorithms, c / c++, javascript, math, monte carlo, Monte Carlo Simulation, Monte Carlo Simulation Algorithm
No Comments
A point is chosen randomly in a square. 4 lines are drawn to connect this point with the 4 vertices of this square, such that 4 triangles are formed. …