Learn Big O Notation in French: Notation Big O Flashcards, Tri Fusion to Borne Serrée
French edition of the Big O deck: 44 cards with French backs - recherche dichotomique, tri fusion, borne serrée, complexité amortie - plus the card to fix.
Studying. But it's also a video game. 🎮
Flashcards, quizzes and games that make you actually remember.
Posted by
FLIP IT TeamRelated reading
Master Dynamic Programming with 30 Flashcards: Memoization, Knapsack, LCS and Bitmask DP
Master dynamic programming with deck AI3432: 30 flashcards on memoization, tabulation, knapsack, LCS, LIS, edit distance, Kadane, bitmask and digit DP.
Study Guide: Software Testing in 40 Flashcards — Unit, Integration and 30 More Test Types
Learn software testing with 40 flashcards: unit vs integration, the test pyramid, smoke vs sanity, load vs stress, code coverage, mutation testing and TDD.
Learn Big O Notation in German: 44 Flashcards on Landau-Notation, Schranken and Sorting Costs
German edition of the Big O flashcard deck: obere, untere and scharfe Schranke, Mergesort, Knoten and Kanten, plus three cards to fix before you study.
Deck DJ2446 – Notation Big O on Flip It is the French edition of our English Big O Notation deck. It has the same 44 cards, with English fronts and backs written in French. That suits a French speaker preparing for a concours, a BUT/école d'ingénieur exam, or a technical interview in France, where interviewers say tri fusion, not "merge sort".
Study this deck: Notation Big O
1 / 10Big O notation
Tap the card for the answer · swipe right if you knew it, left if not
Sample cards (French backs as written)
| Front | Back |
|---|---|
| O(log n) complexity | Temps logarithmique… (par exemple, la recherche dichotomique) |
| O(n log n) complexity | Temps linéarithmique ou quasi-linéaire… tri fusion et tri par tas |
| Big Theta (Θ) notation | f est bornée par g à la fois par au-dessus et par en-dessous (borne serrée) |
| 'in-place' | Un algorithme qui ne nécessite qu'un espace supplémentaire de O(1) ou O(log n) |
| Worst-case time complexity of quicksort | O(n²) |
| Inverse Ackermann function's complexity | O(α(n))… utilisée dans les opérations sur les ensembles disjoints |
| Letter 'O' | Ordnung (allemand pour « ordre ») |
| Is log₂(n) different from log₁₀(n)? | Non… O(log₂ n) = O(log₁₀ n) = O(log n) |
The vocabulary you actually gain
Temps constant, logarithmique, linéaire, linéarithmique, exponentiel; borne supérieure / inférieure / serrée; équivalence asymptotique (~); recherche dichotomique vs recherche linéaire; tri rapide, tri fusion, tri par tas, tri à bulles, tri par insertion; complexité spatiale, en place, complexité amortie; meilleur cas / pire cas; sommets and arêtes in Dijkstra O((V+E) log V), Bellman-Ford O(VE) and Floyd-Warshall O(V³); temps polylogarithmique, superpolynomial, sous-exponentiel; Soft-O (Õ), little-o, Vinogradov's ≪, and Knuth's role in Θ and Ω.
Tips for the French edition
Learn the term pairs, not just the definitions. Many backs are long sentences. Reduce each one to a single term-to-term recall: binary search → recherche dichotomique, heapsort → tri par tas, tight bound → borne serrée, disjoint sets → ensembles disjoints. French courses use these words constantly, and dichotomique is the one English speakers never guess.
Fix card 15 in every edition. It answers "O(n log n) dans le cas moyen" for the best possible comparison sort. The correct statement is a lower bound, Ω(n log n), and it holds in the worst case: no comparison sort can do better. Rewrite the back to say so. Card 19 (bubble sort O(n) in the best case) is only true with an early-exit flag, so add avec arrêt anticipé. The deck still has no examples of O(n²) or O(n!) as complexity classes; write two cards for them, nested loops and brute-force permutations.
For the data structures behind these costs, see Learn Data Structures with 95 Flashcards.
Ready to learn faster? 🚀
Join FLIP IT for free and turn studying into a game.