Search:

Type: Posts; User: sbjibo

Search: Search took 0.09 seconds.

  1. Replies
    12
    Views
    2,083

    [SOLVED] Re: Alphabetical order

    i figured it out: When you type this

    words [g] = swaplow (words [g], words [g + 1]);
    words [g + 1] = swaphigh (words [g], words [g + 1]);
    you have type this in its...
  2. Replies
    12
    Views
    2,083

    [SOLVED] Re: Alphabetical order

    it still gives exceptions
  3. Replies
    12
    Views
    2,083

    [SOLVED] Re: Alphabetical order

    for (; count < word1.length() ; count++)
    {
    if (word1.charAt (count) > word2.charAt (count))
    {
    index = word1;
    break;
    }...
  4. Replies
    12
    Views
    2,083

    [SOLVED] Re: Alphabetical order

    And to compile, you can use the Scanner method intead of console. But you have to modify the code a bit
  5. Replies
    12
    Views
    2,083

    [SOLVED] Re: Alphabetical order

    It is like a bubble sort. you switch the position of 2 consecutive items in the array. And you loop it for the number of elements the array has. The 'h' variable is to keep track of how many more...
  6. Replies
    12
    Views
    2,083

    [SOLVED] Re: Alphabetical order

    Ya i know. It tells the users to enter the words with the same length
  7. Replies
    12
    Views
    2,083

    [SOLVED] Alphabetical order

    This is a program where the user types a bunch of words and then the program rearranges them into alphabetical order and then prints them.
    But this code keeps crashing on line 35 at "for (int count...
Results 1 to 7 of 7