About SortingLab 🎮🔢
Welcome to SortingLab, a game-based learning experience designed for computer science students who want to master sorting algorithms in a fun and interactive way!
What is a Sorting Algorithm?
A sorting algorithm is a method used to arrange elements (like numbers or letters) into a specific order, typically ascending or descending. Different sorting algorithms have unique strategies for organizing data efficiently.
Sorting is a fundamental concept in computer science and is widely used in databases, search engines, and even video games! Recognizing how sorting works can improve your ability to analyze and organize information effectively, sharpening problem-solving skills and deepening understanding of how data behaves in real-world applications.
To describe the "speed" of an algorithm, we use something called Big O notation. Big O notation classifies algorithms based on how their execution time changes with the input size, "n". For example, an algorithm that runs in direct proportion to its input size is classified as O(n). Other algorithms can have different execution times, such as:
-
🔹 O(n²) = Grows rapidly as input increases, quickly becoming slower with larger datasets.
-
🔹 O(n log n) = Grows moderately as input increases, balancing efficiency and performance. The algorithm divides the problem into smaller parts (log n) and processes each part in linear fashion (n).
How to play
-
1️⃣ Select a sorting algorithm from the main menu.
-
2️⃣ Each game presents a list of unsorted elements that must be arranged according to the chosen algorithm.
-
3️⃣ Use the provided buttons to apply the sorting technique step by step.
-
4️⃣ Press Submit ✅ when you think the list is correctly sorted.
If you want to back out of a game you can always press the "SortingLab" logo to go back to the main menu.
If you want to, there is a dark mode you can activate by clicking the sun icon at the top.
Back to menu