top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Can we modify the selection sort algorithm which will take less than O(n^2) time in best case?

+1 vote
318 views
Can we modify the selection sort algorithm which will take less than O(n^2) time in best case?
posted Jul 22, 2016 by anonymous

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button

Similar Questions
+2 votes

here is the sample code of problem :
a=100000000,b=200000;
multiplication=1;
while(a--){
multiplication=multiplication*b;
}
printf "multiplication= result"
reduce the time complexity by giving a suitable example which must have less complexity than this for large numbers.

...