Created by manuel-eleve-1re-indice2019
Created on November 05, 2019
318 Bytes
def lettres(Texte,k): n=len(Texte) p=0 ALPH="abcdefghijklmnopqrstuvwxyz" for i in range(n): if Texte[i]==ALPH[k]: p=p+1 f=p/n return(ALPH[k],f) def freqlettres(Texte): S=[] for k in range(26): S.append(lettres(Texte,k)) return(S)