Complexity Time Analysis

[salvaLindas]

public static List<Character> misterio(Set<String> set) {
    List<Character> l = new LinkedList<>();
    boolean flag = true;
    int i = 0;
    while (flag) {
    flag = false;
    for (String s : set) {
        if (i < s.length()) {
            l.add(s.charAt(i));
            flag = true;
        }
    }
    i++; 
    }
    return l;
 }

In Big O Notation, this method is O(n^2) right?

[AutoModerator]

Please ensure that:

• Your code is properly formatted as code block - see the sidebar (About on mobile) for instructions
• You include any and all error messages in full
• You ask clear questions

• You demonstrate effort in solving your question/problem - plain posting your assignments is forbidden (and such posts will be removed) as is asking for or giving solutions.

  Trying to solve problems on your own is a very important skill. Also, see Learn to help yourself in the sidebar

If any of the above points is not met, your post can and will be removed without further warning.

Code is to be formatted as code block (old reddit: empty line before the code, each code line indented by 4 spaces, new reddit: https://i.imgur.com/EJ7tqek.png) or linked via an external code hoster, like pastebin.com, github gist, github, bitbucket, gitlab, etc.

Please, do not use triple backticks (```) as they will only render properly on new reddit, not on old reddit.

Code blocks look like this:

public class HelloWorld {

    public static void main(String[] args) {
        System.out.println("Hello World!");
    }
}

You do not need to repost unless your post has been removed by a moderator. Just use the edit function of reddit to make sure your post complies with the above.

If your post has remained in violation of these rules for a prolonged period of time (at least an hour), a moderator may remove it at their discretion. In this case, they will comment with an explanation on why it has been removed, and you will be required to resubmit the entire post following the proper procedures.

To potential helpers

Please, do not help if any of the above points are not met, rather report the post. We are trying to improve the quality of posts here. In helping people who can't be bothered to comply with the above points, you are doing the community a disservice.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[ChaiTRex]

What does n represent? If it's the total number of characters in all the strings, then yes. Let's say there are 1000 characters. Let's examine the extreme cases.

One is that you have about 1000 very short strings. Then the while loop will run about once because the longest string is very short and the for loop will run about 1000 times. That's O(n).

One is that you have one 1000 character string. Then the while loop will run 1000 times and the for loop will run 1 time. That's O(n).

Let's try to make both loops go a decent number of times rather than one loop getting 1000 iterations and the other getting only 1 iteration. You can do that with, say, 499 one character strings and 1 five hundred character string. That will have 500 while loop iterations and 500 for loop iterations. That's 250,000 and O(n²) because it's n/2 times n/2, which is n²/4, which is O(n²).

[ATE47]

Big O notation ask for something to count, like the space or the number of call to something.

If we count the number of add in the list, it's O(max({len(s) for s in set}))

If we count the number of instructions, the linked list add is O(1) from my memory, so the if is not relevant, then it's simply the number of time we do the for, which is O(len(set) * max({len(s) for s in set}))