Algorithms Illuminated pdf epub mobi txt 電子書下載2025

☆☆☆☆☆

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University, where he has taught and researched algorithms since 2004. This book is the first of a four-part series based on his online algorithms courses that have been running regularly since 2012.

出版者:Soundlikeyourself Publishing

作者:Tim Roughgarden

出品人:

頁數:218

译者:

出版時間:2017-9-27

價格:USD 17.99

裝幀:Paperback

isbn號碼:9780999282908

叢書系列:Algorithms Illuminated

圖書標籤:

Algorithm
算法
計算機科學
計算機
2017
美國
工具教程
CS

下載連結在頁面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製連結

想要找書就要到小美書屋

book.quotespace.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.

具體描述

讀後感

評分☆☆☆☆☆

原书是这么写的，但是经过反复验证，c=a*a，而不是c=b*b。所以这里应该是作者笔误写错了。顺便贴一下js的实现： /* * 快速n方计算 * */ function fastPower (a, b) { var c, temp; if (b === 1) { return a; } else { c = b * b; temp = fastPower(c, Math.floor(b/2)) } if (...

評分☆☆☆☆☆