gaurav.gupta@mq.edu.au recursion

Level 1 (Pass)

- sum  - repeat H   - countDigitsRecursive H   - sumDigitsRecursive H   - sumOddRecursive 

Level 2 (Pass - Credit)

- removeLeadingZeroes  - gcdRecursiveBasic H   - gcdRecursive  - collatzRecursive H   - singleDigitSumRecursive 

Level 3 (Credit - Distinction)

- multiplyRecursive  - fastPower H   - nextSquareRecursive  - nextPrimeRecursive 

Level 4 (Distinction - High Distinction)

- fibonacci  - tribonacci  - commonDigit  - binarySearch H   - areAnagrams H   - addSubtractUpTo H   - diffDates1 H  

Level 5 (High Distinction)

- nCombinationsAddingTo H   - diffDates2 H   - isSquareRoot H  

Level Neo*

- quickSort  - lexicographicPermutation  (Due to the abstract nature of the problem)

---------

* reference from Matrix
Authoring docs

Copyright Nick Parlante 2017 - privacy