124 lines
1.2 KiB
Python
124 lines
1.2 KiB
Python
# PREUD'HOMME Geoffrey
|
||
# BEAUSSART Jean-loup
|
||
# Donné le 27/01/201question(5)
|
||
|
||
# TP2 Anagrammes - Dictionnaires
|
||
|
||
# http://www.fil.univ-lille1.fr/~L1S2API/CoursTP/tp2_dictionnaires.html
|
||
|
||
|
||
def partie(nom):
|
||
print('\n\n\n###', nom, '###')
|
||
|
||
|
||
def section(nom):
|
||
print('\n\n===', nom, '===')
|
||
|
||
|
||
def question(numero):
|
||
print('\n***', 'Question', numero, '***')
|
||
|
||
|
||
partie('Quelques méthodes sur les listes et les chaîntes')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
question(3)
|
||
|
||
|
||
section('Méthode split')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
question(3)
|
||
|
||
|
||
section('Méthode join')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
question(3)
|
||
|
||
question(4)
|
||
|
||
|
||
section('Méthode sort')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
|
||
section('Une fonction sort pour les chaînes')
|
||
|
||
question(1)
|
||
|
||
|
||
partie('Anagrammes')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
question(3)
|
||
|
||
|
||
section('Casse et accentuation')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
question(3)
|
||
|
||
|
||
partie('Recherche d\'anagrammes')
|
||
|
||
|
||
section('Le lexique')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
question(3)
|
||
|
||
question(4)
|
||
|
||
|
||
section('Anagrammes d’un mot : première méthode')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
|
||
section('Anagrammes d’un mot : seconde méthode')
|
||
|
||
question(1)
|
||
|
||
question(2)
|
||
|
||
question(3)
|
||
|
||
question(4)
|
||
|
||
question(5)
|
||
|
||
|
||
section('Comparaison des deux méthodes')
|
||
|
||
question(1)
|
||
|
||
|
||
partie('Phrases d\'anagrammes')
|
||
|
||
question(1)
|
||
|