2022-02-03 18:47:06 +00:00
|
|
|
import { Heading, Chapter, Box, Idiomatic as I, Code, Anchor as A, Panel, BringAttention as B, ListOrdered, ListUnordered } from "@steffo/bluelib-react"
|
2022-06-28 17:13:40 +00:00
|
|
|
import type { NextPage, NextPageContext } from "next"
|
2022-02-04 01:14:51 +00:00
|
|
|
import { MaterialLi } from "../../../components/materialLi"
|
2022-02-03 18:47:06 +00:00
|
|
|
|
|
|
|
|
|
2022-06-28 17:13:40 +00:00
|
|
|
export async function getStaticProps(_context: NextPageContext) {
|
|
|
|
|
return {
|
|
|
|
|
props: {}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2022-02-03 18:47:06 +00:00
|
|
|
const Page: NextPage = () => {
|
|
|
|
|
return <>
|
|
|
|
|
<Heading level={2}>
|
|
|
|
|
Algoritmi e strutture dati
|
|
|
|
|
</Heading>
|
|
|
|
|
<Chapter>
|
|
|
|
|
<Box>
|
|
|
|
|
<Heading level={3}>
|
|
|
|
|
Premessa
|
|
|
|
|
</Heading>
|
|
|
|
|
<p>
|
|
|
|
|
Il corso di <I>Algoritmi e strutture dati</I> è stato piuttosto impegnativo ma al tempo stesso interessante: quasi tutti i concetti mi erano nuovi, e di conseguenza ho imparato un sacco!
|
|
|
|
|
</p>
|
|
|
|
|
</Box>
|
|
|
|
|
</Chapter>
|
|
|
|
|
<Chapter>
|
|
|
|
|
<Box>
|
|
|
|
|
<Heading level={3}>
|
|
|
|
|
Materiale raccolto
|
|
|
|
|
</Heading>
|
|
|
|
|
<p>
|
|
|
|
|
Tutto il materiale che ho realizzato per il corso è in formato Markdown esteso con espressioni matematiche TeX.
|
|
|
|
|
</p>
|
|
|
|
|
<Chapter>
|
|
|
|
|
<Panel>
|
|
|
|
|
<Heading level={4}>
|
|
|
|
|
Appunti di teoria
|
|
|
|
|
</Heading>
|
|
|
|
|
<ListOrdered>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="01_IlNomeDelCorso">
|
2022-02-03 18:47:06 +00:00
|
|
|
Il nome del corso
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="02_EfficienzaDegliAlgoritmi">
|
2022-02-03 18:47:06 +00:00
|
|
|
Efficienza degli algoritmi
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="03_ModelliAlgoritmici">
|
2022-02-03 18:47:06 +00:00
|
|
|
Modelli algoritmici
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="04_NotazioneAsintotica">
|
2022-02-03 18:47:06 +00:00
|
|
|
Notazione asintotica
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="05_ProblemiAlgoritmici">
|
2022-02-03 18:47:06 +00:00
|
|
|
Problemi algoritmici
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="06_RicercaBinaria">
|
2022-02-03 18:47:06 +00:00
|
|
|
Ricerca binaria
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="07_DivideEtImpera">
|
2022-02-03 18:47:06 +00:00
|
|
|
Divide et impera
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="08_MasterTheorem">
|
2022-02-03 18:47:06 +00:00
|
|
|
Master theorem
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="09_MasterTheoremSubset">
|
2022-02-03 18:47:06 +00:00
|
|
|
Master theorem subset
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="10_Ordinamento">
|
2022-02-03 18:47:06 +00:00
|
|
|
Ordinamento
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="11_InsertionSort">
|
2022-02-03 18:47:06 +00:00
|
|
|
Insertion sort
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="11_MergeSort">
|
2022-02-03 18:47:06 +00:00
|
|
|
Merge sort
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="11_QuickSort">
|
2022-02-03 18:47:06 +00:00
|
|
|
Quick sort
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="12_CountingSort">
|
2022-02-03 18:47:06 +00:00
|
|
|
Counting sort
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="13_IntroAlleStruttureDati">
|
2022-02-03 18:47:06 +00:00
|
|
|
Introduzione alle strutture dati
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="14_Array">
|
2022-02-03 18:47:06 +00:00
|
|
|
Array
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="14_Lista">
|
2022-02-03 18:47:06 +00:00
|
|
|
Lista
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="15_Coda">
|
2022-02-03 18:47:06 +00:00
|
|
|
Coda
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="15_Pila">
|
2022-02-03 18:47:06 +00:00
|
|
|
Pila
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="16_AlberoRadicato">
|
2022-02-03 18:47:06 +00:00
|
|
|
Albero radicato
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="17_BreadthFirstSearch">
|
2022-02-03 18:47:06 +00:00
|
|
|
Breadth-first search
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="17_DepthFirstSearch">
|
2022-02-03 18:47:06 +00:00
|
|
|
Depth-first search
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="18_AlberoBinarioDiRicerca">
|
2022-02-03 18:47:06 +00:00
|
|
|
Albero binario di ricerca
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="19_HeapBinario">
|
2022-02-03 18:47:06 +00:00
|
|
|
Heap binario
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="20_CodaConPriorità">
|
2022-02-03 18:47:06 +00:00
|
|
|
Coda con priorità
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="20_HeapSort">
|
2022-02-03 18:47:06 +00:00
|
|
|
Heap sort
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="21_Grafo">
|
2022-02-03 18:47:06 +00:00
|
|
|
Grafo
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="22_VisitareUnGrafo">
|
2022-02-03 18:47:06 +00:00
|
|
|
Visitare un grafo
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="23_AlgoritmiGreedy">
|
2022-02-03 18:47:06 +00:00
|
|
|
Algoritmi greedy
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="24_PercorsoPiùBreve">
|
2022-02-03 18:47:06 +00:00
|
|
|
Percorso più breve
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="25_AlgoritmoDiDijkstra">
|
2022-02-03 18:47:06 +00:00
|
|
|
Algoritmo di Dijkstra
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="26_AlgoritmoDiBellmanFord">
|
2022-02-03 18:47:06 +00:00
|
|
|
Algoritmo di Bellman-Ford
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="27_DisjointSet">
|
2022-02-03 18:47:06 +00:00
|
|
|
Disjoint set
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="28_TrovareIlMST">
|
2022-02-03 18:47:06 +00:00
|
|
|
Trovare il minimum spanning tree
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="29_AlgoritmoDiKruskal">
|
2022-02-03 18:47:06 +00:00
|
|
|
Algoritmo di Kruskal
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="29_AlgoritmoDiPrim">
|
2022-02-03 18:47:06 +00:00
|
|
|
Algoritmo di Prim
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="30_Compressione">
|
2022-02-03 18:47:06 +00:00
|
|
|
Compressione
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="31_AlgoritmoDiHuffman">
|
2022-02-03 18:47:06 +00:00
|
|
|
Algoritmo di Huffman
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="32_Dizionari">
|
2022-02-03 18:47:06 +00:00
|
|
|
Dizionari
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="33_ProgrammazioneDinamica">
|
2022-02-03 18:47:06 +00:00
|
|
|
Programmazione dinamica
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="34_ProblemaDelloZaino">
|
2022-02-03 18:47:06 +00:00
|
|
|
Problema dello zaino
|
|
|
|
|
</MaterialLi>
|
2022-02-04 01:14:51 +00:00
|
|
|
<MaterialLi base="/materials/year1/algoritmi" md="35_ProblemiIntrattabili">
|
2022-02-03 18:47:06 +00:00
|
|
|
Problemi intrattabili
|
|
|
|
|
</MaterialLi>
|
|
|
|
|
</ListOrdered>
|
|
|
|
|
</Panel>
|
|
|
|
|
</Chapter>
|
|
|
|
|
</Box>
|
|
|
|
|
</Chapter>
|
|
|
|
|
</>
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
export default Page
|
