In a recent Computer Science lesson, our Year 11 pupils delved into the fascinating world of sorting and searching algorithms by taking part in a unique and engaging activity. Each pupil was assigned a number to represent, and the class collaborated to apply the principles of the merge sort algorithm.

Mrs. D Lees, Subject Leader for Computer Science, explains, “Merge Sort is a fundamental algorithm that divides data into smaller chunks, sorts them, and then combines them to create an ordered list. It’s like organising a deck of cards by continuously dividing and merging the piles.”

The pupils began by meticulously ensuring that all the data was in order, employing the divide-and-conquer strategy. They split the data in half continually until each segment contained a single element. Subsequently, they skilfully combined the data back into lists, comparing the first index elements each time. This process was repeated until all elements were seamlessly combined.

Mrs Lees said: “This hands-on activity provided our pupils with a fantastic visual tool to comprehend the intricacies of merge sort. Witnessing the step-by-step process helped them grasp the concept more vividly. Our pupils are truly putting in commendable effort, showcasing their dedication to mastering these fundamental algorithms.”

We’re immensely proud of our Year 11 pupils for their dedication and enthusiasm in tackling challenging concepts. The merge sort activity not only enhanced their understanding of algorithms but also fostered teamwork and critical thinking skills.

#RespecttheCTAWay #Community #Tenacity #Aspiration