Sortieralgorithmen (EN)

Sorting Algorithms Compared

flowchart TD     A[Unsorted Data] --> B{Algorithm}     B --> C[Bubble Sort]     B --> D[Quick Sort]     B --> E[Merge Sort]     B --> F[Insertion Sort]     C --> G[Time Complexity: O(n²)]     D --> H[Time Complexity: O(n log n)]     E --> I[Time Complexity: O(n log n)]     F --> J[Time Complexity: O(n²)]     G --> K[Sorted Data]     H --> K     I --> K     J --> K 

In Context

• Typically used together with search algorithms
• Related to: Algorithmics, Data Structures, Complexity Theory
• Example use: Database queries, Search engine indexing