You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
implement a dollar splitting algorithm visualizer/widget
This is a classic discrete math problem but we should allow the user to enter a dollar amount and choose between brute force or iterative algorithms. We could also display the coins visually with an 3x label or such
implement the GOO algorithm after you think about it more
The core of the GOO (Group Order Optimizer) algorithm is an algorithm to find the maximum order of an nth symmetric group. For example, s5 is (12345) and the max order is (123)(45) which equals 3x2 or 6. Basically the numbers 1-n are put into a cycle and the goal is to make disjoint cycles which produce a maximum order.
The text was updated successfully, but these errors were encountered:
This is a classic discrete math problem but we should allow the user to enter a dollar amount and choose between brute force or iterative algorithms. We could also display the coins visually with an 3x label or such
The core of the GOO (Group Order Optimizer) algorithm is an algorithm to find the maximum order of an nth symmetric group. For example, s5 is (12345) and the max order is (123)(45) which equals 3x2 or 6. Basically the numbers 1-n are put into a cycle and the goal is to make disjoint cycles which produce a maximum order.
The text was updated successfully, but these errors were encountered: