APPLICATION DE L'ALGO DE WAGNER ET FISHER

private ArrayList WagnerAndFisher(ref String[] tabMots, String mot)
        {
            int tailleTab = tabMots.Length;                 
            int longMot = mot.Length;
            int[] longueur = new int[tailleTab];
            String temp;
            Boolean modif = false;
            do
            {
                modif = false;
                for (int i = 1; i < tabMots.Length; i++)
                {
                    if (tabMots[i].Length > tabMots[i - 1].Length)
                    {
                        modif = true;
                        temp = tabMots[i];
                        tabMots[i] = tabMots[i - 1];
                        tabMots[i - 1] = temp;
                    }
                }
            }while (modif);

            for (int cptMots = 0; cptMots < tailleTab; cptMots++)
            {
                int longMotTest = tabMots[cptMots].Length;
                char[] tab_char = new char[longMotTest];
                tab_char = tabMots[cptMots].ToUpper().ToCharArray();
                int[,] matrice = new int[longMotTest, longMot];
                matrice[0, 0] = 0;
                int m1;
                int m2;
                int m3;
                for (int i = 1; i < longMotTest; i++)
                {
                    matrice[i, 0] = matrice[i - 1, 0] + 1;
                }
                for (int j = 1; j < longMot; j++)
                {
                    matrice[0, j] = matrice[0, j - 1] + 1;
                }
                for (int i = 1; i < longMotTest; i++)
                {
                    for (int j = 1; j < longMot; j++)
                    {
                        if (tab_char[i] == mot[j])
                        {
                            m1 = matrice[i - 1, j - 1];
                        }
                        else
                        {
                            m1 = matrice[i - 1, j - 1] + 1;
                        }
                        m2 = matrice[i - 1, j] + 1;
                        m3 = matrice[i, j - 1] + 1;
                        if ((m1 <= m2) && (m1 <= m3))
                        {
                            matrice[i, j] = m1;
                        }
                        else if ((m2 <= m1) && (m2 <= m3))
                        {
                            matrice[i, j] = m2;
                        }
                        else if ((m3 <= m2) && (m3 <= m1))
                        {
                            matrice[i, j] = m3;
                        }
                    }
                }
                longueur[cptMots] = matrice[longMotTest - 1, longMot - 1] + cptMots;
            }
            int min = longueur[0];
            String[] resultat = new String[tailleTab];
            int cpt = 0;
            for (int i = 0; i < tailleTab; i++)
            {
                if (min > longueur[i])
                {
                    min = longueur[i];
                    resultat[0] = tabMots[i];
                    cpt = 1;
                }
                else if (min == longueur[i])
                {
                    resultat[cpt] = tabMots[i];
                    cpt = cpt + 1;
                }

            }
            ArrayList listeRetour = new ArrayList();
            for (int i = 0; i < resultat.Length; i++)
            {
                listeRetour.Add(resultat[i]);
            }

            listeRetour.Sort();
            return listeRetour;
        }