knuthNumbers

The first Knuth Number is 1. Each subsequent Knuth Number is 1 + the smaller of either 2*K((n-1)/2) or 3*K((n-1)/3). The first 10 Knuth Numbers are 1, 3, 3, 4, 7, 7, 7, 9, 9, 10. knuthNumbers(0) → 1 knuthNumbers(1) → 3 knuthNumbers(2) → 3 Go...Save, Compile, Run (ctrl-enter) public int knuthNumbers(int n){ } Go Editor font size %:75100125150 Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Copyright Nick Parlante 2017 - privacy