====== Algoritmi di Ordinamento ======

Nella lezione del 26/11, abbiamo visto i principali [[wp>Sorting_algorithm|algoritmi di ordinamento]]:
  * [[wp>Bubble_sort|Bubblesort]]
  * [[wp>Insertion_sort|Insertion sort]]
  * [[wp>Selection_sort|Selection sort]]
  * [[wp>Merge_sort|Mergesort]]
  * [[wp>Quicksort]]
  * Binsort
  * [[wp>Radix_sort|Radix sort]]

Vedremo che alcuni altri algoritmi di ordinamento possono essere realizzati usando strutture d'appoggio basate su alberi, in particolare lo [[wp>Heapsort]].

{{teaching:info3:sort2008.tgz|Qui}} potete trovare le implementazioni in Python dei vari algoritmi (aggiornata rispetto allo scorso anno).

==== Sorting Algorithm ====

In the 26/11 lecture, we've seen the most common [[wp>Sorting_algorithm|sorting algorithms]]:
  * [[wp>Bubble_sort|Bubblesort]]
  * [[wp>Insertion_sort|Insertion sort]]
  * [[wp>Selection_sort|Selection sort]]
  * [[wp>Merge_sort|Mergesort]]
  * [[wp>Quicksort]]
  * Binsort
  * [[wp>Radix_sort|Radix sort]]

We'll see that some additional sorting algorithms can be implemented with tree-based data structures -- specifically [[wp>Heapsort]].

{{teaching:info3:sort2008.tgz|Here}} you can find the Python implementations of the algorithms seen at lecture (updated with respect to last year's code).