The Recamán’s Sequence is a well-known recursive sequence used in Mathematics and Computer Science. It can easily be implemented using a recursive function. Recamán’s sequence a0, a1, a2, … is defined as: The first terms of the sequence are: 0,…
Learning Zone ✕
Theory Concepts
Cryptography Computer Hardware Computer Networks Algorithms OOP Programming Binary Data Boolean Logic Database ConceptsInteractive Quizzes
View All QuizzesGCSE Computer Science (UK)
1.1 System Architecture 1.2 Memory and Storage 1.3 Computer networks 1.4 Network security 1.5 – Systems software 1.6 – Impacts of digital technology2.1 – Algorithms 2.2 – Programming fundamentals 2.3 – Producing robust programs 2.4 – Boolean logic 2.5 – Programming languages and IDEs
A-Level Computer Science (UK)
1.1 Contemporary processors, input, output and storage devices 1.2 Software and software development 1.3 Exchanging data 1.4 Data types, data structures and algorithms 1.5 Legal, moral, cultural and ethical issues2.1 Elements of computational thinking 2.2 Problem solving and programming 2.3 Algorithms
Coding Challenges ✕
Python Challenges
Online Python IDE Python Challenges - All Levels Python Challenges - Beginner Level Python Challenges - Intermediate Level Python Challenges - Advanced Level Python Turtle Challenges Solved Challenges Online Glowscript IDEHTML / CSS & JavaScript
HTML / CSS & JS Editor HTML / CSS & JS ChallengesLMC
LMC Challenges LMC SimulatorSQL
SQL ChallengesBlock Programming
BBC micro:bit Challenges Scratch ChallengesInteractive Coding Puzzles
Pirate Island Space Explorer Interactive Coding QuizzesOnline Interactive Tools ✕
Coding Tools
Online Python IDE HTML / CSS & JS Editor LMC Simulator Online Glowscript IDE Flowchart Sudio Trace Table 101 Dashboard Difference Engine Emulator Analytical Engine EmulatorDesign Tools
Network Designer Database ERD DesignerLogic Gates Circuits
Logic Gates Circuits Simulator Logic Gates Diagrams Binary Activities Karnaugh MapsMore results...
Member's Area ✕
Tag: recursion
Flood-Fill Algorithm
The aim of this challenge is to demonstrate the use of a recursive algorithm used in most Graphic Editing Software when you use the fill tool to quickly and automatically fill a selected area with a solid colour. To demonstrate…
Poem Decoding Challenge
To celebrate the start of the Winter, we have asked our Artificial Intelligence “AI-101” to generate a poem about the cold winter weather. The AI has generated the following poem which consists of a list of numbers! We believe the…
The Moroccan Spices Box Set Puzzle
In the heart of the medina of Marrakech, you will find one of the largest and most colourful souks in Morocco. In this souk, you will find merchants selling traditional clothing, multicoloured carpets, pottery, jewellery, antiques, lanterns, spices, etc. On…
Recursive vs. Iterative Algorithm – Q&A
Question 1[2 marks] For this question, we are looking at an algorithm used to implement the divisibility rule for 3 which states that: A number is divisible by 3 if the sum of all its digits is divisible by 3.… The Climbing Stairs Puzzle
Imagine a staircase with n steps. As you are climbing up this staircase, you either climb one or two steps at a time. The aim of this computing puzzle is to find out, using an algorithm, in how many distinct…
Divisibility Rules
For this challenge we will investigate a range of algorithms used to apply some of the most common divisibility rules. We will first focus on the divisibility rule of 3 to introduce the concept of recursion. A divisibility rule is…
Recursive vs. Iterative Palindrome Check
For this challenge we will investigate two algorithms used to find out if a word is a palindrome or not. The first algorithm will use an iterative approach, the second algorithm will use a recursive approach. Iterative Approach An iterative…
The Social Network
Six Degrees of Separation The Six degrees of separation is an idea that was originally set out by Frigyes Karinthy in 1929 and that can be applied to Social Networks such as Facebook. It is based on the idea that…
Backtracking Maze – Path Finder
The purpose of this Python challenge is to demonstrate the use of a backtracking algorithm to find the exit path of Maze. Backtracking Algorithm A backtracking algorithm is a recursive algorithm that attempts to solve a given problem by testing…
LMC Simulator
Logic Gates Circuits
Network Designer
Flowchart Studio
Online Python IDE