Details

Verjetnostna analiza sortirnih algoritmov : delo diplomskega seminarja
ID Dolenc, Martin (Author), ID Perman, Mihael (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (438,52 KB)
MD5: B39669CDB50498EB0DD2360FE2D1B8E8

Abstract
V delu si bomo ogledali, kako lahko s pomočjo verjetnosti analiziramo obnašanje sortirnih algoritmov in si ogledali rezultate analize za nekatere klasične sortirne algoritme.

Language:Slovenian
Keywords:verjetnostna analiza, limitni izreki
Work type:Final seminar paper
Typology:2.11 - Undergraduate Thesis
Organization:FMF - Faculty of Mathematics and Physics
Year:2025
PID:20.500.12556/RUL-168424 This link opens in a new window
UDC:519.2
COBISS.SI-ID:232500483 This link opens in a new window
Publication date in RUL:12.04.2025
Views:309
Downloads:96
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Probabilistic analysis of sorting algorithms
Abstract:
In this work we will look at how we can use probability to analyze the behavior of sorting algorithms and look at the results of the analysis on some classic algorithms.

Keywords:probabilistic analysis, limit theorems

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back