An Interactive Pedagogical Framework for Divide and Conquer Algorithms

Read full text Summarise with VIRAT
Authors: Dana-Marciana Jebelean
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Abstract: This educational resource provides a fully interactive, web-based platform designed to facilitate the understanding of Divide and Conquer algorithms. Aimed at high school students, competitive programming trainees, and computer science undergraduates, the portal translates abstract recursive concepts into intuitive, step-by-step visual simulations. Content and Features: The platform adopts an "edutainment" approach and includes four main interactive modules: Towers of Hanoi: Visualizing the core principle of dividing a complex problem into simpler sub-problems (Divide, Conquer, Combine). QuickSort Analysis: A step-by-step visual trace of the partitioning logic, pivot selection, and recursive flow. Merge Sort (Classic): Visualization of the array decomposition and the merging process using auxiliary structures (L and R arrays). Optimized Merge Sort: Advanced implementation techniques tailored for competitive programming (Olympiads), demonstrating high-efficiency memory usage. Technical Details: Developed entirely with HTML, CSS, and JavaScript, the platform requires no backend infrastructure or installation. It can be run locally by students or hosted directly on any web server. Usage: This material serves as a ready-to-use Open Educational Resource (OER) for computer science teachers looking to enhance classroom engagement, as well as a self-paced learning tool for students. Live version available at: http://danajebelean.com/Edutainment/DEI

Fields of Study & Subjects

Teaching and Learning Programming Multimedia Learning Systems Educational Technology and E-Learning

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
20 March 2026
Language
EN