|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 6 van 14 gevonden artikelen
| Titel: |
How many interchanges does the selection sort make for iid geometric(p) input? |
| Auteur: |
SAHANI Debasish CHAKRABORTY Soubhik |
| Verschenen in: |
Anale. Serie informaticÿéa |
| Paginering: | Jaargang VII (2009) nr. 2 pagina's 67-76 |
| Jaar: |
2009 |
| Inhoud: |
The note derives an expression for the number of interchanges made by selection sort when the sorting elements are iid variates from geometric distribution. Empirical results reveal we can work with a simpler model compared to what is suggestive in theory. The morale is that statistical analysis of an algorithm’s complexity has something to offer in its own right and should be therefore ventured not with a predetermined mindset to verify what we already know in theory. Herein also lies the concept of an empirical O, a novel although subjective bound estimate over a finite input range obtained by running computer experiments. For an arbitrary algorithm, where theoretical results could be tedious, this could be of greater use. |
| Uitgever: |
Mirton Publishing House, Timisoara (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 6 van 14 gevonden artikelen
| << vorige | volgende >> |