Algorithms

Algorithms pdf epub mobi txt 电子书 下载 2025

Jeff Erickson is a professor of computer science at the University of Illinois at Urbana-Champaign, where he has been a faculty member since 1998. His research interests lie at the intersection of algorithm design and discrete mathematics, especially for problems involving geometry, topology, graphs, and optimization.

Jeff's father used to keep an “electric hammer” in his office. It was a regular hammer with a battery, an LED, and a toggle switch that he'd built into the handle. Whenever someone would ask how it worked, he would flip the switch, turning the LED on, and say “There. Now it's on.”

出版者:Independently published
作者:Jeff Erickson
出品人:
页数:472
译者:
出版时间:2019-6-13
价格:USD 27.50
装帧:Paperback
isbn号码:9781792644832
丛书系列:
图书标签:
  • 算法 
  • 计算机科学 
  • 计算机 
  • 数据结构与算法 
  • CS 
  • Algorithm 
  • 编程 
  • Computer 
  •  
想要找书就要到 小哈图书下载中心
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

Algorithms are the lifeblood of computer science. They are the machines that proofs build and the music that programs play. Their history is as old as mathematics itself. This textbook is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the problem-solving process. The book includes important classical examples, hundreds of battle-tested exercises, far too many historical digressions, and exaclty four typos. Jeff Erickson is a computer science professor at the University of Illinois, Urbana-Champaign; this book is based on algorithms classes he has taught there since 1998.

具体描述

读后感

评分

评分

评分

评分

评分

用户评价

评分

多一种解释,rainbow magic好评

评分

递归、分治、动态规划、贪心、图基本算法、DFS、最小生成树、最短路径,适合进阶了解算法

评分

递归、分治、动态规划、贪心、图基本算法、DFS、最小生成树、最短路径,适合进阶了解算法

评分

递归、分治、动态规划、贪心、图基本算法、DFS、最小生成树、最短路径,适合进阶了解算法

评分

好看!剧情跌宕起伏 故事线条理清晰。推荐!

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 qciss.net All Rights Reserved. 小哈图书下载中心 版权所有