Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -61,7 +61,7 @@ Numbers

**Coin Flip Simulation** - Write some code that simulates flipping a single coin however many times the user decides. The code should record the outcomes and count the number of tails and heads. [[scottdchris (Python)]](https://github.com/scottdchris/CoinFlip) [[aysark (Java)]](https://github.com/aysark/Review/blob/master/Projects/src/CoinFlip.java) [[JaredCubilla (Javascript)]](https://github.com/JaredCubilla/Projects/blob/master/Javascript/numbers/coinFlip.js) [[dsub15 (Python)]](https://github.com/dsub15/Projects/blob/master/Coin_flip.py)[[mandeepbhutani (Python)]](https://github.com/mandeepbhutani/Sample-Projects/blob/master/CoinFlip.py) [[viktorahlstrom (Bash)]](https://github.com/viktorahlstrom/all/blob/master/coding-problems-solved/projects-solutions/coinflip.sh)[[viktorahlstrom (Python)]](https://github.com/viktorahlstrom/all/blob/master/python/coin.py)[[viktorahlstrom (Java)]](https://github.com/viktorahlstrom/all/blob/master/java/coinflip.java) [[mandliya(C++)]](https://github.com/mandliya/short-fun-projects/blob/master/coin-flip-simulation/coinFlip.cpp)

**Limit Calculator** - Ask the user to enter f(x) and the limit value, then return the value of the limit statement *Optional: Make the calculator capable of supporting infinite limits.*[[ChrisBlair (Java)]](https://github.com/ChrisBlair2019/SummerProjectsJAVA/tree/master/Limits)
**Limit Calculator** - Ask the user to enter f(x) and the limit value, then return the value of the limit statement *Optional: Make the calculator capable of supporting infinite limits.*[[ChrisBlair (Java)]](https://github.com/ChrisBlair2019/SummerProjectsJAVA/tree/master/Limits) [[DrakeCoding (Python)]](https://github.com/DrakeCoding/Projects/blob/main/limit.py))

**Fast Exponentiation** - Ask the user to enter 2 integers a and b and output a^b (i.e. pow(a,b)) in O(lg n) time complexity. [[chrislyc1991(C++)]](https://github.com/chrislyc1991/project-1/blob/master/FastExpo.cpp) [[korabum (Python)]](https://github.com/korabum/Projects/blob/master/Numbers/power.py)

Expand Down