Home of real teaching & learning
  • Full support for teachers
  • Focus on critical thinking
  • Engaging classroom activities
  • Integrated student eBook
  • Assessed tasks / qBank
  • Practice exam questions
Find out more Download brochure

The InThinking Guarantee: Our sites are written by expert practitioners and not by AI

See our AI policy

Disclaimer: InThinking subject sites are neither endorsed by nor connected with the International Baccalaureate Organisation.

Don't miss out, find out!

B2.4 Broken Code challenges - Java

B2.4 Broken Code challenges - JavaB2.4.1: Algorithms & Efficiency (Big O)/* Topic B2.4.1: Big O Notation & Efficiency CHALLENGE: This code checks for duplicates. It works, but it is inefficient. It compares every pair of numbers twice! HINT: Look at the inner loop 'int j = 0'. If i is 5, we have already checked indices 0-4 against 5 in previous loops. */ public class Main { public static boolean hasDuplicates(int[]...

Help