# What is the time complexity for splitting the string into two new string in the rope data structure?

Category: QuestionsWhat is the time complexity for splitting the string into two new string in the rope data structure?
Editor">Editor Staff asked 5 months ago

What is the time complexity for splitting the string into two new string in the rope data structure?

(a) O (n^2)

(b) O (n!)

(c) O (log n)

(d) O (1)

This intriguing question comes from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I

I got this question in final exam.

Editor">Editor Staff answered 5 months ago

Correct choice is (c) O (log n)

To explain: In order to perform the splitting on the rope data structure, one can split the given string into two new string S1 and S2 in O (log n) time. So, the time complexity for worst case is O (log n).

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701