How to Think about Algorithms

How to Think about Algorithms pdf epub mobi txt 電子書 下載2025

出版者:Cambridge University Press
作者:Jeff Edmonds
出品人:
頁數:472
译者:
出版時間:2008-5-19
價格:$ 138.99
裝幀:
isbn號碼:9780521849319
叢書系列:
圖書標籤:
  • 算法
  • Programming
  • Algorithm
  • 算法思維
  • 編程基礎
  • 計算機科學
  • 邏輯思維
  • 問題解決
  • 數據結構
  • 算法設計
  • 計算思維
  • 實踐指南
  • 學習方法
想要找書就要到 小美書屋
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

具體描述

There are many algorithm texts that provide lots of well-polished code and proofs of correctness. This book is not one of them. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author helps students avoid the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. Part of the goal is to teach the students to think abstractly. Without getting bogged with formal proofs, the book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a slow and clear manner accessible to second- or third-year students of computer science, preparing them to find their own innovative ways to solve problems.

著者簡介

圖書目錄

讀後感

評分

評分

評分

評分

評分

用戶評價

评分

评分

评分

评分

评分

本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度google,bing,sogou

© 2025 book.quotespace.org All Rights Reserved. 小美書屋 版权所有