Lesson 1/1~14 min

Practice

Maximum, searching, sorting and numeric algorithms.

What you practise here

1Practice

Start the exercises

Short tasks that check you understand: multiple choice, predicting the output, finding the bug, completing code.

  1. Find the bugThe maximum of negative numbersElementary20 XP
  2. Multiple choiceHow many steps?Elementary20 XP
  3. True / falseWhat binary search needsBasic10 XP
  4. Predict the outputEuclid's algorithmElementary20 XP
  5. Predict the outputOne pass of bubble sortIntermediate30 XP
  6. Complete the codeWhere is the value?Elementary20 XP
  7. Code comprehensionA prime testElementary20 XP