Awesome q2a theme
0 votes

for tym complexity it like …..n times we need to search position so O(nlogn) 

n insertion so O(n)

and only two rotation so O(logn)...because i m not rotating for each iteration just doing at last

so overall O(nlogn)...please look...

in DS by (25 points) | 8 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
8,968 questions
3,119 answers
95,792 users