Sorting and return values from parralell arrays

Question

import java.io.*;
import java.util.*;
class Check{
     String words;
     String signature;
     Check(String w, String s){
          words = w;
          signature = s;
class Test{
     static String[]a = new String[100];
     static String[]b = new String[100];
     public static void main(String[] args)throws IOException{
          Scanner in = new Scanner(new FileReader("input.txt"));
          //Check []ch = new Check[100];
          String str = in.next();
int z = 0;
      while(!(str.equals("$$$$"))){            
       a[z] = str;
       b[z] = getNumberSequenceFromString(str);
       z++;
       str = in.next();
          insertionSort(a,0,z);
          insertionSort(b,0,z);
     //     for(int i = 0; i < z; i++){
///     System.out.println(a);
          for (int i = 0; i < z ; i++){
               System.out.println(a[i]+" "+b[i]);
          String key = "225533";//should give the word "move", istead it is giving me "TEXT" which is incorrect
          int rope = binarySearch(key,b,0,z-1);
          System.out.println("rrrrrrrrrrrrrrropr "+ rope);
          System.out.println("i found him :"+a[rope/2]);
     }//end main
     public static String getNumberSequenceFromString(String word){
          int l = word.length();
          String str = " ";
          word = word = word.toLowerCase();
     for(int i = 0; i < l; i++){
               char y = word.charAt(i);
     if(y < 100){
          str +=2;
     }else if(y < 103){
          str +=3;
     }else if( y < 106){
          str +=4;
     }else if( y < 109){
          str += 5;
     }else if(y < 112){
          str += 6;
     }else if(y < 116){
          str += 7;
     }else if (y < 119){
          str += 8;
     }else{
          str +=9;
     }//end for
          return str;
     }//end getWord();
     public static void insertionSort(String[]list,int lo, int n){
     for(int j = lo+1; j < n; j++){
          String key = list[j];
          int k = j-1;
          while(k >= lo && key.compareToIgnoreCase(list[k]) < 0){
               list[k + 1] = list[k];
               --k;
          }//end while
          list[k+1] = key;
     }//end for
}//end insertion sort
     public static int binarySearch(String key, String[]b, int lo, int hi){
     while(lo <= hi-1){
          int mid = (lo + hi)/2;
          System.out.println("i am mmmmmmmmmmmmmid" + mid);
          int cmp = key.compareToIgnoreCase(b[mid]);
          if (cmp==0)return mid;
          if (cmp < 0)hi = mid -1;
          else lo = mid + 1;
     }//end while
     return lo;
}//end binarysearch
}//end classAbove is my revise code.  Your idea worked fine, thank you.  I have a problem though.  I tried to create a class eg:
class Check{
String words;//for words
String signature; //for numbers
Check (String w, String s){
words = w;
signature = s;
The idea was to store the word and its signature as an object, after which I would sort.  Howerver, when I tried reading in the values eg: check[]=str, number, it did not work.  I tried 2 separate arrays, but now I cannot return the correct word. I need some help on this one.
Questions:
How could I combine both arrays so that I could sort them, then search a value in the array and return the correct string?
I tried a class but i could not get it to work.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   

Answer 1

I'm not going to try to read all that messy code. Here is some advice.
1. Don't use parallel arrays.
2. If you're going to insist on doing it the wrong way and using parallel arrays, then first get your sort working for a single array.
3. If you're going to insist on doing it the wrong way and using parallel arrays, then after getting the sort to work with a single array, in the part where you're swapping elements, whatever you do to swap in the first array, you'll need to do to the second array as well.
4. Break your code down into methods.