5 one-dimensional arrays of mixed types (float and String) or 1 two-dimensional array of type String?

The two arrays have the same content ie:

Code:

String[] array1 = {"Hello", "Goodbye", "What's Up?"};
String[] array2 = {"Yes", "No", "Maybe"};
String[] array3 = {"Question", "Answer", "Unknown"};
float[] array4 = {0.0, 1.0, 2.0};
float[] array5 = {3.0, 4.0, 5.0};

String[][] array6 = {
    {"Hello", "Yes", "Question", "0.0", "3.0"},
    {"Goodbye", "No", "Answer", "1.0", "4.0"},
    {"What's Up?", "Maybe", "Unknown", "2.0", "5.0"},
};

 

quoting Jackson, one of the computer science gurus they teach you at university:

"Don't optimize! If you have to, do it as the last step, after you have designed the program properly"

In this case, array6 does not represent the problem correctly, so you should keep away from it.  

PS: don't take it from me, take it from the man:

http://www.jacksonworkbench.co.uk/stevefergspages/jackson_methods/EinsteinLecturingOnJackson.jpg

Neither...
Well, first solution is the least ugly of the two.
But since all data are related (or seems to be, if I follow the array6 example), it is better to group them in the same unit.
For this, you can create a class:
Code:

class Stuff
{
  String smallTalk;
  String answer;
  String topic;
  float oneValue;
  float anotherValue;

  SomeInformation(String st, String a, String t, float ov, float av)
  {
    smallTalk = st;
    answer = a;
    topic = t;
    oneValue = ov;
    anotherValue = av;
  }
} 

Of course, you should find more significant class name and field names...
Then you initialize as:
Code:

Stuff[] info =
{
    new Stuff("Hello", "Yes", "Question", 0.0, 3.0),
    new Stuff("Goodbye", "No", "Answer", "1.0", "4.0"),
    new Stuff("What's Up?", "Maybe", "Unknown", "2.0", "5.0")
}; 

Moreover, it maintains consistency, which is harder with independent arrays.
Thus, as I see your second question while I type this answer, you can sort the array according to whatever field you want, relation between data is preserved.
To sort an array of objects, you have to look into Comparable or Comparator classes (interfaces). Something raised from time to time in the forum, a quick search should give hints.

Thanks for the input. Im not sure why I was so reluctant to put it into a class. Ill do that. Im not too familiar with standard Java sorting methods, Java at all really. Thats why I use Processing, ha!

I did a quick search and found the hack for "Comparable," Ill give this a try and keep you guys posted.

===== Forgot the link
http://processing.org/hacks/hacks:comparable

I was concerned about size because Im using a couple other libraries and using a lot of particles to comprise this project Im working on. Just trying to save space where I can.