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
selenask
0
Newbie Poster
Recommended Answers
Jump to PostGoogle.
Jump to PostAlright, 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
verruckt24
438
Posting Shark
verruckt24
438
Posting Shark
selenask
0
Newbie Poster
selenask
0
Newbie Poster
BestJewSinceJC
700
Posting Maven
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.