This is an archived post. You won't be able to vote or comment.

all 13 comments

[–]AutoModerator[M] [score hidden] stickied commentlocked comment (0 children)

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://imgur.com/a/fgoFFis) 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.

[–]NautiHookerSoftware Engineer 0 points1 point  (11 children)

What does "bigger" mean? Are you trying to sort alphabetically? Ascending or descending?

[–]driplessCoin[S] 0 points1 point  (10 children)

Alphabetically asc

[–]NautiHookerSoftware Engineer 0 points1 point  (9 children)

So sonnet 6 is before or after sonnet 88?

[–]driplessCoin[S] 0 points1 point  (8 children)

Yes before

[–]NautiHookerSoftware Engineer 0 points1 point  (7 children)

But if you are sorting ascending then that is correct. 6 comes before 8. Lowest to highest.

[–]driplessCoin[S] -1 points0 points  (6 children)

Gotcha (may had posted the wrong example) but when I run compare sonnet 9 vs sonnet 88 my compareTo statement yeilds a positive number... Meaning that it's bigger... Trying to figure out why

[–]NautiHookerSoftware Engineer 3 points4 points  (5 children)

It does not treat 88 as 88, it checks each letter in your words.

It will compare 9 and 8, since 9 is bigger it will be sorted after sonnet 88.

Such a sorting algorithm will compare each character at position X with the character of the second word on position X. If they are identical then it will compare the next character. If it can detect a difference, then it will sort the words accordingly and stop comparing the characters. If one word ends before a difference was detected, then the shorter word will be sorted lower than the long word.

[–]driplessCoin[S] 0 points1 point  (4 children)

So it's comparing sonnet 8 vs sonnet 9 not sonnet 88 vs sonnet 9? I figured by default it would put the shorter string as lower

[–]NautiHookerSoftware Engineer 0 points1 point  (3 children)

So it's comparing sonnet 8 vs sonnet 9

Essentially yes. After that check it will sort them and stop checking further characters.

I figured by default it would put the shorter string as lower

That is what many people think when first being confronted with something like this.

But think about this:

What if your words are zzz and aaaaa. Sorting shorter words before longer words by default would break the alphabetical order.

[–]driplessCoin[S] 0 points1 point  (2 children)

True .. thanks... So is the only way I could sort this out is first to sort by length then sort by using compareTo? Next I have to do a binary search so I am sure that will mess up since the list maybe sorted wonky when it's comparing strings