Hi, Im suppose to write a Maximum consecutive sorted substring in a string. "abacdefkabfh" is acdefk. Im suppose to analyze the time omplexity of an algorithm.. I dont know where to begin
Jump to Post
Alright, no one's come up with help as of now so I proceed forward.
What you could do is move through the entire string character by character, everytime comparing whether current character is greater than the previous one. 'Greater than' means that the character comes later in the alphabet …
All 5 Replies
Be a part of the DaniWeb community
We're a friendly, industry-focused community of 1.21 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.