Pamela E. Harris, Jan Kretschmann, J. Carlos Martínez Mori
{"title":"幸运汽车和快速排序算法","authors":"Pamela E. Harris, Jan Kretschmann, J. Carlos Martínez Mori","doi":"10.1080/00029890.2024.2309103","DOIUrl":null,"url":null,"abstract":"Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of 2(n+1)Hn−4n comparisons on an array of size n ordered uniformly at random, where Hn:=...","PeriodicalId":517373,"journal":{"name":"American Mathematical Monthly","volume":"20 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lucky Cars and the Quicksort Algorithm\",\"authors\":\"Pamela E. Harris, Jan Kretschmann, J. Carlos Martínez Mori\",\"doi\":\"10.1080/00029890.2024.2309103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of 2(n+1)Hn−4n comparisons on an array of size n ordered uniformly at random, where Hn:=...\",\"PeriodicalId\":517373,\"journal\":{\"name\":\"American Mathematical Monthly\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"American Mathematical Monthly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/00029890.2024.2309103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Mathematical Monthly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/00029890.2024.2309103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
Quicksort 是一种经典的分而治之排序算法。它是一种比较排序，在大小为 n 的数组上平均进行 2(n+1)Hn-4n 次随机均匀排序的比较，其中 Hn:=...
Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of 2(n+1)Hn−4n comparisons on an array of size n ordered uniformly at random, where Hn:=...
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
