Name several sort algorithms of an array, their working principles and their efficency.

Bubble sort (compare two elements and switch them if one of them is higher than other, depending on ordering preference), iterate over the whole array of elements. Efficency O(n2).

Insert sort, make a separate list, where you insert the elements in an ordered manner, that is start at the smallest element and go until an element that is bigger than the input or end of list and insert it before that. Efficency O(n2).

Selection sort, iterate over the whole array and find the smallest element, put it into start, then iterate from smallest +1, then smallest +2. Efficency O(n2).

Merge sort, split array into smaller arrays until size 1 is reached, then assume size 1 is sorted, then merge them while sorting, the sub arrays. Efficency O(n logn).

Quicksort. Select a pivot point, split all elements that are larger than that to one side, smaller to other, then put the pivot, where it belongs. After do it on smaller arrays, when all is done, the arrays are merged and the final array is sorted. Efficency O(n logn).  

Egidijus S. IB Computing tutor, IB Maths tutor

1 year ago

Answered by Egidijus, an IB Computing tutor with MyTutor

Still stuck? Get one-to-one help from a personally interviewed subject specialist


£20 /hr

Carlota O.

Degree: Computer Science (Bachelors) - University College London University

Subjects offered: Computing, Physics+ 2 more

Business Studies

“About meI am a Computer Science student at University College London. I have a passion for math and sciences and I look forward to help out with any of these areas.In high school, I completed the International Baccalaureate programm...”

£20 /hr

Sara J.

Degree: Computing Science (Bachelors) - Glasgow University

Subjects offered: Computing, Geography+ 2 more

English Language
-Personal Statements-

“About me Hello! I'm a first-year undergraduate student at University of Glasgow. I play ukulele, drink fancy tea and like nerdy things. I also love learning and teaching – there is nothing more rewarding than helping people this way. ...”

£20 /hr

João D.

Degree: Computer Science (Bachelors) - Bath University

Subjects offered: Computing, ICT


“Computer Science has always been a passion of mine, academically and as a hobby. It combines creativity with analytical thinking and I found that very appealing. In retrospect, all of my best teachers, lecturers and tutors had a share...”

About the author

£20 /hr

Egidijus S.

Degree: Informatics MInf (Masters) - Edinburgh University

Subjects offered: Computing, Maths


“Top tutor from the renowned Russell university group, ready to help you improve your grades.”

MyTutor guarantee

You may also like...

Posts by Egidijus

Add the binary numbers 100101 and 101001 and convert them to decimal (they are unsigned integers). What are possible issues when adding the numbers?

Name several sort algorithms of an array, their working principles and their efficency.

Name the memories in the computer and rate them by the amount of space and their price. When should which be used.

Show that the following system of equations has an infinite number of solutions. x+y+2z = -2; 3x-y+14z=6; x+2y=-5

Other IB Computing questions

What is data validation and data verification?

What are adventages and disadventages of encryption network security?

Name several sort algorithms of an array, their working principles and their efficency.

Explain the difference between the cache memory and the buffer.

View IB Computing tutors


We use cookies to improve our service. By continuing to use this website, we'll assume that you're OK with this. Dismiss