Ad
  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    Nicely implemented, and the comments make it good as a learning resource for newbies like me.

    One question: in the stopping condition, how come you check !code? What does that do that codeArray.length doesn't already do?

  • Default User Avatar

    Is this bubble sort? As I understand, bubble sort would go through the array left to right, switching pairs that are next to each other, then repeat until no pairs are able to be switched.

    e.g.: CDBEA / CBDEA / CDBAE / CBDAE / CBADE / BCADE / BACDE / ABCDE

    This code does it differently, checking (and swapping) the first element against the second, then against the third, etc., and then starts again from the second element onwards, and so on.

    e.g.: CDBEA / BDCEA / ADCEB / ACDEB / ABDEC / ABCED / ABCDE

    I'm new to this and don't know anything about algorithms, but I'm trying to learn so I thought I'd check :)