COMPLEJIDAD INSERTAR ORDENADO

                                                                              //O(n)
    public void insertarOrdenado(T info){         //T=2+max(1,3+2+2+2+E(2+3+5+1+max(1,)+1+2+2+max(1,2+3)))
        if (this.esVacia())                                                     //2-
            this.insertarAlInicio(info);                                        //1
        else{   
            Nodo<T> x=this.cabeza;                                              //3
            Nodo<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());                      //5
                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 Nodo<T>(info, x));                                 //2
                this.tamanio++;                                                 //3
                }
            }
     }

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

T=2+9+22n = 11+22n = n

O(n)