Help with my project please

Question

Hi guys am back sorry to bother you but i was wondering if you can help me find out why my program telling me the element i search for is not in the array?
import java.io.*;
import javax.swing.JOptionPane;
import javax.swing.JFileChooser;
public class BusinessProyect {
     public static void main (String args[]) {
          String companyName, companyStreet, companyCity, companyState, companyZipCode;
               companyName = JOptionPane.showInputDialog("Enter Business Name");
                    if (companyName == null) System.exit(0);
               companyStreet = JOptionPane.showInputDialog("Enter Business Street");
                    if (companyName == null) System.exit(0);
               companyCity = JOptionPane.showInputDialog("Enter Business City");
                    if (companyName == null) System.exit(0);
               companyState = JOptionPane.showInputDialog("Enter Business State");
                    if (companyName == null) System.exit(0);
               companyZipCode = JOptionPane.showInputDialog("Enter Business Zip Code");
                    if (companyName == null) System.exit(0);
          System.out.print("Business Name: ");
          System.out.print(" "+companyName);
          System.out.print("\nAddress: ");
          System.out.print("\t"+companyStreet+"\t");
          System.out.print("\n"+"\t"+"\t"+companyCity+",");
          System.out.print(companyState+".");
          System.out.print(companyZipCode+"\n");
          String search = null;
          String[] businessProducts = new String[15];
          boolean found = false;
                    System.out.println("\n"+"The Product Sold");
               for(int i=0; i<=14; i++)
                    businessProducts[i] = JOptionPane.showInputDialog(null, "Enter Name Of The Product " + (i+1));
               for(int i=0; i<=14; i++)
                    System.out.println((i+1) + "." + businessProducts);
          bubblesort (businessProducts);
          System.out.println("\nSORTED NAMES");
          for (int i = 0; i < businessProducts.length; i++)
               System.out.println(businessProducts [i]);
          search = JOptionPane.showInputDialog("Enter name to search.");
          for (int i = 0; i < businessProducts.length; i++) {
               if(search.equals(businessProducts[i++])) {
                    found = true;
                    JOptionPane.showMessageDialog(null,search+" was found in element #"+i);
               } // end if
          if (found == false)
               JOptionPane.showMessageDialog(null,search+" was not found.");
     } // end main
     public static void bubblesort (String[] a) {
          for(int i=1; i<a.length; i++) {
               for(int j=0; j<a.length-i; j++) {
                    if(a[j].compareTo(a[j+1]) > 0) swap(a, j, j+1);
               } // end inner for
          } // end outer for
     } // end bubblesort
     public static void swap (String[] a, int i, int j) {
          String h = a[i];
          a[i] = a[j];
          a[j] = h;
} // end swap
} // end classEdited by: MoonShadow on Mar 13, 2008 6:26 PM                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           

Answer 1

Hi guys i redo the code and is almost finish only got one last problem... When i search for a product name it gives me the wrong index number if i enter the name of a product that is in 15 it says found index 14 how can i add 1 so it well get the exact one...
import java.io.*;
import javax.swing.JOptionPane;
import javax.swing.JFileChooser;
public class MyFirstProyect2 {
     public static void main (String args[]) {
          String companyName, companyStreet, companyCity, companyState, companyZipCode;
               companyName = JOptionPane.showInputDialog("Enter Business Name");
                    if (companyName == null) System.exit(0);
               companyStreet = JOptionPane.showInputDialog("Enter Business Street");
                    if (companyName == null) System.exit(0);
               companyCity = JOptionPane.showInputDialog("Enter Business City");
                    if (companyName == null) System.exit(0);
               companyState = JOptionPane.showInputDialog("Enter Business State");
                    if (companyName == null) System.exit(0);
               companyZipCode = JOptionPane.showInputDialog("Enter Business Zip Code");
                    if (companyName == null) System.exit(0);
          System.out.print("Business Name: ");
          System.out.print(" "+companyName);
          System.out.print("\nAddress: ");
          System.out.print("\t"+companyStreet+"\t");
          System.out.print("\n"+"\t"+"\t"+companyCity+",");
          System.out.print(companyState+".");
          System.out.print(companyZipCode+"\n");
          String businessProducts[] = new  String[15], productName;
          boolean checkList = false;
          int temp, i, j, found;
          for (i = 0; i < businessProducts.length; i++) {
               businessProducts=JOptionPane.showInputDialog("Enter Name Of Product ("+(i+1)+").");
               if (businessProducts[i] == null) {
                    JOptionPane.showMessageDialog(null, "You cancelled.","NAME SEARCH",JOptionPane.INFORMATION_MESSAGE);
                    System.exit(0);
          System.out.println("\n"+"The Product Sold");
          for (i = 0; i < businessProducts.length; i++)
               System.out.println((i+1) + "." + businessProducts[i]);
          selectionSort (businessProducts);
          System.out.println("\nProducts Sold Sorted");
          for (i = 0; i < businessProducts.length; i++)
               System.out.println((i+1) + "." + businessProducts[i]);
          checkList = true;
          productName = JOptionPane.showInputDialog("Name Product To Search: ");
          if (productName == null)     {     // user clicked the cancel button
               JOptionPane.showMessageDialog(null, "You cancelled.","NAME SEARCH",JOptionPane.INFORMATION_MESSAGE);
               checkList = false;
          while (checkList) {
               found = BinarySearch(businessProducts, productName);
               if (found != -1)
                    JOptionPane.showMessageDialog(null, "Product found on element "+found+".","NAME SEARCH",JOptionPane.INFORMATION_MESSAGE);
               else
                    JOptionPane.showMessageDialog(null, "Product not found"+found,"NAME SEARCH",JOptionPane.ERROR_MESSAGE);
               productName = JOptionPane.showInputDialog("Name Product To Search: ");
               if (productName == null)
                    checkList = false;
          JOptionPane.showMessageDialog(null, "This Program Has Ended","YOU CANCELLED THE SEARCH",JOptionPane.ERROR_MESSAGE);
          public static int BinarySearch (String[] a, String searchValue) {
               int left = 0;
               int right = a.length - 1;
               while (left <= right) {
                    int midpoint = (left + right) / 2;
                    if (a[midpoint].compareTo(searchValue) == 0)
                         return midpoint;
                    else if(a[midpoint].compareTo(searchValue) < 0)
                         left = midpoint + 1;
                    else
                         right = midpoint - 1;
               return -1;
          public static void selectionSort (String[] a) {
               for (int i = 0; i < a.length - 1; i++) {
                    int minIndex = findMinimum(a, i);
                    if (minIndex !=i)
                         swap(a, i, minIndex);
          public static int findMinimum(String[] a, int first) {
               int minIndex = first;
               for (int i = first + 1; i < a.length; i++)
                    if(a[i].compareTo(a[minIndex]) < 0)
                         minIndex = i;
               return minIndex;
          public static void swap(String[] a, int x, int y) {
               String temp = a[x];
               a[x] = a[y];
               a[y] = temp;
}Edited by: MoonShadow on Mar 13, 2008 9:06 PM