COMPLEJIDAD INSERTAR ORDENADO

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

t = 2+3+2+1+1n+3n+4n+1n+1n+1n+2n+1+5 = 14+12n = n

O(n)