COMPLEJIDAD INSERTAR ORDENADO

     */                                                                         //O(n)
    public void insertarOrdenado(T info){           //T=2+max(1,3+2+2+2+E(2+3+4+1+max(1,)+1+2)+2+max(1,2+2+3))
        if (this.esVacia())                                                     //2-
            this.insertarAlInicio(info);                                        //1
        else{                           
            NodoD<T> x=this.cabeza;                                             //3
            NodoD<T> y=x;                                                       //2
            x = x.getSig();                                                     //2
            while(x!=this.cabeza){                                              //2+E(2)
                Comparable comparador=(Comparable)info;                         //3
                int rta=comparador.compareTo(x.getInfo());                      //4
                if(rta<0)                                                       //1-
                    break;                                                      //1
                y=x;                                                            //1
                x=x.getSig();                                                   //2
            }
            if(x==cabeza.getSig())                                              //2-
                this.insertarAlInicio(info);                                    //1
            else{   
                y.setSig(new NodoD<T>(info, x, y));                             //2
                x.setAnt(y.getSig());                                           //2
                this.tamanio++;                                                 //3
                }
            }
     }

T = 2+max(1,3+2+2+2+2n+3n+4n+1n+1n+1n+2n+2+max(1,2+2+3))

T = 2+max(1,3+2+2+2+2n+3n+4n+1n+1n+1n+2n+2+7)

T = 2+18+14n

T = n

O(n)