Bubble, Merge & Insertion Sort Algorithms

Thanks

Hello, looks like your merge sort example is wrong. 1 & 5 cannot be merged if you do this algorithm recursively.

ARE YOU AHOMASECKSHA

gcse in 2 hours el o el

GCSE in less than an hour 💀

Can you explain quick sort

I have an interview tomorrow morning, I am watching it right now at midnight.
Let's hope my interview goes well.

My exam is in a hour… so thanks ig

thanks so much man you are a life saver

ty

When the exam is in 7hrs and you haven't studied:

Quite interesting, this was quite helpful I really love your videos! Keep it up mane,

who here is watching in 2021

Quick sort??

Can't stand craig n dave

regarding bubblesort, in the exam if it asks how many passes are required to fully sort the list/array, if it takes 6 passes to completely sort the list/array, is the answer 7 as the computer will need to check that the list/array is sorted wthout the need of having to do any further swaps or do we answer the question as 6 passes needed? please help

Sir do you do A2?

in an OCR exam, would you ever be asked to write the pseudocode for any of these algorithms?

you are so useful i went into watching your videos not knowing much about paper 2 (i got 14 out of 80) to knowing a lot more and being able to write and understand pseuodocode much easier👍

just about to do my gcse computer science mock tomorrow for paper 2 and i wish i found this channel earlier! you're already doing a better job than my teacher!

Well then 😂 tomo gon be great

Parmar, you sexy beast!

Can you please complete paper 3 and 4🙏🏼🙏🏼

here we go 30 minutes away to go for paper 1

I don't get how you would display bubble sort in an exam. Would you just write the result after each pass or show every single swap? :(( I've had questions in class where showing every swap in every pass would take ageeess and i don't wanna waste time during the exam if i don't need to.

9 hours away from my exam, lets go