{"title":"Greedy algorithms on lists","authors":"R. Bird, J. Gibbons","doi":"10.1017/9781108869041.011","DOIUrl":"https://doi.org/10.1017/9781108869041.011","url":null,"abstract":"","PeriodicalId":343501,"journal":{"name":"Algorithm Design with Haskell","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128123405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sorting","authors":"S. Skiena","doi":"10.1002/9781119575955.ch6","DOIUrl":"https://doi.org/10.1002/9781119575955.ch6","url":null,"abstract":"Set Interface (L03-L08) Container build(X) len() given an iterable X, build set from items in X return the number of stored items Static find(k) return the stored item with key k Dynamic insert(x) delete(k) add x to set (replace item with key x.key if one already exists) remove and return the stored item with key k Order iter ord() find min() find max() find next(k) find prev(k) return the stored items one-by-one in key order return the stored item with smallest key return the stored item with largest key return the stored item with smallest key larger than k return the stored item with largest key smaller than k","PeriodicalId":343501,"journal":{"name":"Algorithm Design with Haskell","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. Heinrich, Melissa N C Eisenschenk, Richard J. Harvey, T. Nuttall
{"title":"Basics","authors":"N. Heinrich, Melissa N C Eisenschenk, Richard J. Harvey, T. Nuttall","doi":"10.1201/9781315118147-1","DOIUrl":"https://doi.org/10.1201/9781315118147-1","url":null,"abstract":"","PeriodicalId":343501,"journal":{"name":"Algorithm Design with Haskell","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126606539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：