000			02632nam a2200373 i 4500
001			CR9781108869041
003			UkCbUP
005			20240807172502.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			190912s2020||||enk o ||1 0|eng|d
020			_a9781108869041 (ebook)
020			_z9781108491617 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.9.A43 _bB49 2020
082	0	0	_a005.13 _223
100	1		_aBird, Richard, _d1943- _eauthor.
245	1	0	_aAlgorithm design with Haskell / _cRichard Bird, Jeremy Gibbons.
264		1	_aCambridge : _bCambridge University Press, _c2020.
300			_a1 online resource (xvi, 437 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 29 Jun 2020).
505	0		_aFunctional programming -- Timing -- Useful data structures -- Binary search -- Sorting -- Selection -- Greedy algorithms on lists -- Greedy algorithms on trees -- Greedy algorithms on graphs -- Introduction to thinning -- Segments and subsequences -- Partitions -- Efficient recursions -- Optimum bracketing -- Ways of searching -- Heuristic search.
520			_aThis book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms.
650		0	_aComputer algorithms.
650		0	_aFunctional programming (Computer science)
650		0	_aHaskell (Computer program language)
700	1		_aGibbons, Jeremy, _d1966- _eauthor.
776	0	8	_iPrint version: _z9781108491617
856	4	0	_uhttps://doi.org/10.1017/9781108869041
942			_2ddc _cEB
999			_c9437 _d9437