SEARCH
You are in browse mode. You must login to use MEMORY

   Log in to start


From course:

Computer Science AQA A level

» Start this Course
(Practice similar questions for free)
Question:

Why is the bubble sort algorithm a time complexity of n^2

Author: Will Parker



Answer:

Becasue it conatins a nested loop The outer loop is done n times And the inner loop done approximatly n^2 times


0 / 5  (0 ratings)

1 answer(s) in total