{"product":{"product_id":"0262033844","title":"Introduction to Algorithms, 3rd Edition (The MIT Press)","price":"77.02","image_url":"https://m.media-amazon.com/images/I/41SNoh5ZhOL._SL500_.jpg","url":"https://www.amazon.com/dp/0262033844"},"comments":[{"body":"[Introduction To Algorithms](https://www.amazon.com/dp/0262033844/ref=cm_sw_r_cp_apa_i_W1USDbE3AJSQX) is kind of the gold standard. It's heavily detailed, well written, and I'm pretty sure they put the word \"Introduction\" in there as a joke(it's 1292 pages).","subreddit_name":"cscareerquestions","author":"d4ntr0n"},{"body":"PEOPLE TREAT THIS AS A JOKE BUT I SWEAR BY THIS. listen. as someone who went through college typing and have a job that's mostly typing with documents nearby, I've found documents or books to be unparalleled in wrist support. particularly [Introduction to Algorithms, 3rd Edition](https://www.amazon.com/dp/0262033844/ref=cm_sw_r_cp_apa_glt_fabc_W1J58J4JW3C3VGFCVFTM) puts my wrists at the perfect level for my keyboard. It provides rigidity that some wood wrist supports provide but also some give so that your wrists don't feel stiff as quickly.","subreddit_name":"MechanicalKeyboards","author":"dankprogrammer"},{"body":"While it isn’t necessary a book you flat out read but more of a very useful reference. \r\n\r\nIntroduction to Algorithms, 3rd Edition (The MIT Press) by Thomas H. Cormen\r\n\r\nIntroduction to Algorithms, 3rd Edition (The MIT Press) https://www.amazon.com/dp/0262033844/ref=cm_sw_r_cp_api_glc_fabc_TkBbGbPB72YSB\r\n\r\nIt goes over just about every data structure, the pros and cons of each one, algorithm design, and analysis. Pretty much everything you need to be a software developer and to help prepare for any kind of dev interviews.","subreddit_name":"cscareerquestions","author":"zander073"},{"body":"I will always and forever tell CS students here to take Algorithm Design with Alper Ungor. If you feel somewhat confident with data structures and discrete math, the class will level you up in terms of interview prep and give you an appreciation for the mathematical side of the major in general.\r\n\r\nThe class goes over a lot of the topics in the [Introduction To Algorithms](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844) textbook, starting with sorting algorithms and getting into topics related to dynamic programming, graph traversal, computational geometry, P=NP, etc. Ungor seems to have relaxed with how strict he is with undergraduates, he expressed many times that he prefers teaching undergrads and wanted to make the class more appealing to a larger crowd. He also respected the class a ton and took feedback very seriously","subreddit_name":"ufl","author":"dullchristmas"},{"body":"Those are solutions to problems, I believe you can find a copy online for free but I’m not sure where. It’s definitely a nice book to have in your library though so I recommend buying it. [Amazon] (https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844)","subreddit_name":"csMajors","author":"AgiIity"},{"body":"Dejo la liga por si da flojera buscar\r  \r\nhttps://www.amazon.com.mx/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844/ref=sr\\_1\\_1?\\_\\_mk\\_es\\_MX=%C3%85M%C3%85%C5%BD%C3%95%C3%91\u0026amp;crid=16Y4DCPZIMLY6\u0026amp;dchild=1\u0026amp;keywords=introduction+to+algorithms\u0026amp;qid=1626277977\u0026amp;sprefix=introduction+to+al%2Caps%2C203\u0026amp;sr=8-1","subreddit_name":"mexico","author":"rekiem87"},{"body":"Comovente não é, mas um que me fez chorar sem dúvida foi\r\n[Introduction to Algorithms](https://www.amazon.com.br/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844/ref=asc_df_0262033844/?tag=googleshopp06-20\u0026amp;linkCode=df0\u0026amp;hvadid=379786983971\u0026amp;hvpos=\u0026amp;hvnetw=g\u0026amp;hvrand=12873956121320428999\u0026amp;hvpone=\u0026amp;hvptwo=\u0026amp;hvqmt=\u0026amp;hvdev=m\u0026amp;hvdvcmdl=\u0026amp;hvlocint=\u0026amp;hvlocphy=1001566\u0026amp;hvtargid=pla-422923046610\u0026amp;psc=1) do Thomas Cormen. Hoje em dia o choro começa quando vemos o preço.","subreddit_name":"Livros","author":"_Alien8"},{"body":"http://www.amazon.com/Introduction-Algorithms-3rd-Thomas-Cormen/dp/0262033844/ref=sr_1_1?ie=UTF8\u0026amp;qid=1446006981\u0026amp;sr=8-1\u0026amp;keywords=clrs+algorithms\r\n\r\nthis is the only thing you'll need for academic DS\u0026amp;A. the only good teacher for 146 (taylor) hasn't taught it in like 2 years i believe. There are a plethora of websites with DS\u0026amp;A practice (hacker rank, leetcode, lint code) that will help you train, but that book is the bible.\r\n\r\n the stuff you learn in 146 (implementing basic data structures / algorithms and runtime analysis) are all critical in interviews later. that and some design specification questions\r\n\r\ni would say 80% of my interviews had some algorithm solving so gl\r\n\r\noh yeah one more thing from my experience, interviewing for internships are the lower level sort of problems that you solve IN CLASS so make sure you know them in and out\r\n\r\nfor example off the top of my head the most popular questions are string reversals, linked list manipulation, stuff like atoi.\r\n\r\nlinked lists are the bread and butter of writing code that you know are extremely easy but hard to white board without talking out your thoughts, thus why books like CTCI (cracking the coding interview) recommends you know linked list implementation of all sorts right off the bat","subreddit_name":"SJSU","author":"csthroaway11"},{"body":"I spent 5 years in college to not complete a 4 year degree. Best course/book I'd recommend is https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844. It was challenging, but that's the point. Started with internship at about $32k (a decade ago), which was still underpaid. Got an outside offer and moved on to better things.\r\n\r\nYou will tire when you reach your 30s+. Make sure to make your 20s count (whatever that means to you). Work on interesting problems, make a lot of money, start a side business. Something like that. Don't be lazy.","subreddit_name":"wallstreetbets","author":"bestkoreaa"},{"body":"I half-agree.\r\n\r\nKnuth's books are dense, yes, but Wirth lays down some much-needed theory explaining the relationship between data structures and algorithms, which makes Knuth a lot more easily digestible IMO.\r\n\r\nI strongly recommend Wirth *first*, and then as much as Knuth as you can comfortably handle.\r\n\r\nIf you hit a point where Knuth gets to be too much, then stop and pick up this textbook, which is more oriented towards students of algorithms (as is Wirth): https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844","subreddit_name":"computerscience","author":"ttkciar"},{"body":"\u0026gt; De exemplu, pot spune ca stiu cand trebuie sa folosesc un set in favoarea unei liste, insa nu prea inteleg cum functioneaza in spate nici una dintre ele.\r\n\r\nhttps://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844\r\n\r\nOrice programator trebuie sa parcurca cartea asta cel putin o data ca sa inteleaga ce se intampla \"in spate\".","subreddit_name":"programare","author":"EmbarrassedLab6149"},{"body":"\u0026gt; I følge Google\r\n\r\nHvilken søgning bruger du? Når jeg søger på \"algorithm definition\" så skriver den øverst \"a process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.\"\r\n\r\n\u0026gt; alle fagbøger jeg har læst\r\n\r\nHvilke bøger har du læst? Jeg er selv datalog fra DIKU med speciale i algoritme udvikling og high performance computing. Så jeg har også læst en del om algoritmer, f.eks. store dele af [denne](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844). Jeg hev den lige ud af skabet og slog op på side 5 hvor afsnittet starter: \"Informally, an *algorithm* is any well-defined computational procedure that takes some value, or set of values, as *input* and produces some value, or set of values, as *output*.\"\r\n\r\n\u0026gt; Men fortæl mig din, da jeg er nysgerrig.\r\n\r\nHvis jeg skulle beskrive det med mine egne ord, så ville jeg sige, at en algoritme er for software/datalogi/matematik det som en opskrift er for madlavning: Et sæt af instruktioner der, hvis fulgt, opnår en bestemt ting. F.eks. er det en algoritme man lærer som barn, når man skal dividere to tal. Det som du beskriver, lyder som et eksempel på en algoritme, der træner en form for machine learning model. Altså ikke definitionen for en algoritme.","subreddit_name":"Denmark","author":"HALLUcareface"},{"body":"If you're following the pseudocode style of CLRS, it might look like the following.\r\n\r\n```\r\nAVERAGE(A)\r\n  sum = 0\r\n\r\n  for i = 1 to A.length\r\n    sum = sum + A[i]\r\n\r\n  return sum / A.length\r\n```\r\n\r\nYou can find similar code on page 71 of [Introduction to Algorithms 3rd Edition](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844).\r\n\r\nTake note that CLRS uses 1-based indexing.","subreddit_name":"AskProgramming","author":"davidgeese"},{"body":"Intro to Algorithms is what you want. And leetcode to put it into practice. The 3rd edition is cheap rn because 4th edition just released. Hth. \r\n\r\nIntroduction to Algorithms, 3rd Edition (The MIT Press) https://smile.amazon.com/dp/0262033844/ref=cm_sw_r_cp_api_i_N4CKDBV0HSHWAYH4V9RN","subreddit_name":"learnprogramming","author":"Imaginary-Square"},{"body":"My school used *Introduction to Computer Theory* by Cohen for our Automata Theory course. For DS\u0026amp;A I've heard [this one](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844/ref=zg_bs_132570011_2/138-2923784-7141610?pd_rd_i=0262033844\u0026amp;psc=1) come well recommended. \r\n\r\nBeyond that you'll need to get more specific about what you mean by computer science theory. Almost every subtopic in CS from Computer Architecture to Computer Graphics to Information Theory and all the rest has a theoretical and an applied side.","subreddit_name":"computerscience","author":"LavenderDay3544"}]}