0 Bewertungen0% fanden dieses Dokument nützlich (0 Abstimmungen)
70 Ansichten48 Seiten
This document discusses sorting algorithms and their computational complexity. It begins by defining terms like upper and lower bounds for algorithm complexity. For sorting, the lower bound of comparisons is shown to be Ω(N log N) using decision trees, and mergesort meets this upper bound of O(N log N) comparisons. Several examples of sorting challenges are presented and different sorting algorithms are recommended based on characteristics of each problem like record size, initial order, and independence of files. Applications of sorting in many domains are highlighted. The document concludes by discussing issues with duplicate keys that can cause algorithms like quicksort to degrade.
This document discusses sorting algorithms and their computational complexity. It begins by defining terms like upper and lower bounds for algorithm complexity. For sorting, the lower bound of comparisons is shown to be Ω(N log N) using decision trees, and mergesort meets this upper bound of O(N log N) comparisons. Several examples of sorting challenges are presented and different sorting algorithms are recommended based on characteristics of each problem like record size, initial order, and independence of files. Applications of sorting in many domains are highlighted. The document concludes by discussing issues with duplicate keys that can cause algorithms like quicksort to degrade.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PDF, TXT herunterladen oder online auf Scribd lesen
This document discusses sorting algorithms and their computational complexity. It begins by defining terms like upper and lower bounds for algorithm complexity. For sorting, the lower bound of comparisons is shown to be Ω(N log N) using decision trees, and mergesort meets this upper bound of O(N log N) comparisons. Several examples of sorting challenges are presented and different sorting algorithms are recommended based on characteristics of each problem like record size, initial order, and independence of files. Applications of sorting in many domains are highlighted. The document concludes by discussing issues with duplicate keys that can cause algorithms like quicksort to degrade.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PDF, TXT herunterladen oder online auf Scribd lesen