In computer science, sorting algorithms are used to sort the elements of a data sets in numerical or alphabetical order. In this blog post will investigate the Python code used to implement 4 of the most frequently used sorting algorithms:…
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
Python Challenges - All Levels Python Challenges - Beginner Level Python Challenges - Intermediate Level Python Challenges - Advanced Level Python Turtle Challenges Solved ChallengesBlock Programming
BBC micro:bit Challenges Scratch ChallengesInteractive Coding Puzzles
Pirate Island Space Explorer Interactive Coding QuizzesOnline Interactive Tools ✕
More results...
Member's Area ✕
Author: Administrator
Quick Sort Algorithm
The quick sort algorithm is a divide-and-conquer algorithm that can be implemented using a recursive function. The following graphic explains the different steps of a quick sort algorithm. Note, that the quick sort algorithm starts by identifying a pivot. Depending…
Breadth-First Traversal of a Binary Tree
A tree is a complex data structure used to store data (nodes) in a “parent/child” relationship. The top node of a tree (the node with no parent) is called the root. Each node of a tree can have 0, 1…
Rush Hour Backtracking Algorithm
In this challenge we will implement a backtracking algorithm to solve a game of Rush Hour using a trial and error approach. We will also investigate the need to apply some basic heuristics to improve our algorithm and avoid a…
Noah’s Ark Backtracking Algorithm
In this challenge, we are going to use a backtracking algorithm to solve a puzzle game called Noah’s Ark. First, you will need to fully understand how the game works. You can check the “How To Play” tab on this…
Prime Factor Tree Algorithm
The Prime Factor Tree is a visual technique used in Maths to workout all the prime factors of a large number. With this approach, all the leaf nodes (nodes without sub-branches) are the prime factors of the root node. For…
TCP/IP Protocols and Packet Switching
The TCP/IP protocols are a suite of protocols used to support different types of communication between devices over an IP network such as the Internet. These protocols resulted from research and development conducted by the US Defense Advanced Research Projects…
MI6: Mission Alpha
This is a confidential mission with the highest level of priority. The MI6 needs your skill to complete a very confidential mission: Mission Code: Alpha-01 Mission Priority: Critical Mission Context: The MI6 network has been hacked! As a result, all…
Dice Score Frequency Analysis
In this challenge we will use a Python algorithm to perform a frequency analysis of the score obtained when throwing a set of two dice. Frequency analysis using 1 dice Let’s consider a single 6-sided dice. When using single dice,…
Random Odd and Even Numbers
In this challenge we will focus on using the random library to generate random numbers in Python. The randint() function is used to generate a random integer (whole number) within a given range. import random number = randint(1,100) The above…
LMC Simulator
Logic Gates Circuits
Network Designer
Flowchart Studio
Online Python IDE