{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":21,"n_cols":5,"rows_kept":21,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[13,2,13,3],[14,2,14,3],[15,2,15,3],[18,2,18,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910260622203321"]
[null,null,"Autore",null,"Cormen Thomas H"]
[null,null,"Titolo",null,"Algorithms unlocked / / Thomas H. Cormen"]
[null,null,"Pubbl/distr/stampa",null,"Cambridge, Mass., : MIT Press, 2013"]
[null,null,"ISBN",null,"9780262313230"]
[{"$nulls":4},"0262313235"]
[{"$nulls":4},"9781299284272"]
[{"$nulls":4},"1299284272"]
[{"$nulls":4},"9780262313223"]
[{"$nulls":4},"0262313227"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 PDF (xiii, 222 pages) : illustrations"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Computer algorithms"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Intro -- Contents -- Preface -- 1 What Are Algorithms and Why Should You Care? -- Correctness -- Resource usage -- Computer algorithms for non-computer people -- Computer algorithms for computer people -- Further reading -- 2 How to Describe and Evaluate Computer Algorithms -- How to describe computer algorithms -- How to characterize running times -- Loop invariants -- Recursion -- Further reading -- 3 Algorithms for Sorting and Searching -- Binary search -- Selection sort -- Insertion sort -- Merge sort -- Quicksort -- Recap -- Further reading -- 4 A Lower Bound for Sorting and How to Beat It -- Rules for sorting -- The lower bound on comparison sorting -- Beating the lower bound with counting sort -- Radix sort -- Further reading -- 5 Directed Acyclic Graphs -- Directed acyclic graphs -- Topological sorting -- How to represent a directed graph -- Running time of topological sorting -- Critical path in a PERT chart -- Shortest path in a directed acyclic graph -- Further reading -- 6 Shortest Paths -- Dijkstra's algorithm -- The Bellman-Ford algorithm -- The Floyd-Warshall algorithm -- Further reading -- 7 Algorithms on Strings -- Longest common subsequence -- Transforming one string to another -- String matching -- Further reading -- 8 Foundations of Cryptography -- Simple substitution ciphers -- Symmetric-key cryptography -- Public-key cryptography -- The RSA cryptosystem -- Hybrid cryptosystems -- Computing random numbers -- Further "]
[{"$nulls":4},"reading -- 9 Data Compression -- Huffman codes -- Fax machines -- LZW compression -- Further reading -- 10 Hard? Problems -- Brown trucks -- The classes P and NP and NP-completeness -- Decision problems and reductions -- A Mother Problem -- A sampler of NP-complete problems -- General strategies -- Perspective -- Undecidable problems -- Wrap-up -- Further reading -- Bibliography -- Index."]
[null,null,null,"Sommario/riassunto","Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen -- coauthor of the leading college textbook on the subject -- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order (\"sorting\"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a \"graph\" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time."]