Cargando…

Data structures and algorithms in Swift : implement stacks, queues, dictionaries, and lists in your apps /

Control the performance and stability of the apps you develop in Swift by working with and understanding advanced concepts in data structures and algorithms. All professional developers have to know which data structure and algorithms to use in their development process. Your choice directly affects...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Karimov, Elshad
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berkeley, CA : Apress L.P., 2020.
Temas:
Acceso en línea:Texto completo (Requiere registro previo con correo institucional)

MARC

LEADER 00000cam a2200000 a 4500
001 OR_on1150169612
003 OCoLC
005 20231017213018.0
006 m o d
007 cr un|---aucuu
008 200411s2020 cau o 001 0 eng d
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d GW5XE  |d YDX  |d EBLCP  |d LQU  |d SFB  |d OCLCQ  |d OCLCF  |d UKMGB  |d SXP  |d N$T  |d FIE  |d OCLCQ  |d OCLCO  |d COM  |d OCLCQ  |d GUA  |d AUD  |d OCLCQ  |d OCLCO 
015 |a GBC074163  |2 bnb 
016 7 |a 019809067  |2 Uk 
019 |a 1148228343  |a 1151718842  |a 1152538827  |a 1152544247  |a 1153153330  |a 1153946687  |a 1153982942  |a 1154480787  |a 1175657910 
020 |a 9781484257692  |q (electronic bk.) 
020 |a 1484257693  |q (electronic bk.) 
020 |z 9781484257685 
020 |z 1484257685 
024 7 |a 10.1007/978-1-4842-5769-2  |2 doi 
024 8 |a 10.1007/978-1-4842-5 
029 1 |a AU@  |b 000067052604 
029 1 |a UKMGB  |b 019809067 
035 |a (OCoLC)1150169612  |z (OCoLC)1148228343  |z (OCoLC)1151718842  |z (OCoLC)1152538827  |z (OCoLC)1152544247  |z (OCoLC)1153153330  |z (OCoLC)1153946687  |z (OCoLC)1153982942  |z (OCoLC)1154480787  |z (OCoLC)1175657910 
037 |a com.springer.onix.9781484257692  |b Springer Nature 
050 4 |a QA76.73.S95 
072 7 |a UMQ  |2 bicssc 
072 7 |a COM051370  |2 bisacsh 
072 7 |a UMQ  |2 thema 
072 7 |a ULH  |2 thema 
082 0 4 |a 005.13/3  |2 23 
049 |a UAMI 
100 1 |a Karimov, Elshad. 
245 1 0 |a Data structures and algorithms in Swift :  |b implement stacks, queues, dictionaries, and lists in your apps /  |c Elshad Karimov. 
260 |a Berkeley, CA :  |b Apress L.P.,  |c 2020. 
300 |a 1 online resource (215 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
588 0 |a Print version record. 
505 0 |a Intro -- Table of Contents -- About the Author -- About the Technical Reviewer -- Chapter 1: Arrays -- Introduction -- Main Features of Arrays -- Retrieving Elements from an Array -- Adding Elements to an Array -- Removing Elements from an Array -- Built-in Functions and Properties -- isEmpty -- First and Last -- Reversed and Reverse -- Count -- Important -- Conclusion -- Chapter 2: Dictionaries -- Introduction -- Accessing Values in a Dictionary -- Adding/Modifying to a Dictionary -- Removing a Value from a Dictionary -- Built-in Functions and Properties -- isEmpty -- First -- Count -- Keys 
505 8 |a Conclusion -- Chapter 3: Sets -- Accessing, Adding, and Removing an Element of a Set -- Accessing an Element -- Adding an Element -- Removing Elements -- Set Operations -- Comparison Operations -- Union -- Intersection -- Subtracting -- Symmetric Difference -- Membership and Equality Operations -- Set Equality -- Set Membership -- Conclusion -- Chapter 4: Stacks -- Using Swift with Stacks -- Stack Structures -- Stack Extensions -- Conclusion -- Chapter 5: Queue -- Implementation -- Conclusion -- Chapter 6: Linked Lists -- Implementation -- Node -- Singly Linked List 
505 8 |a Adding New Values to a Linked List -- Append -- Insert -- Removing New Values from a Linked List -- removeLast -- remove(at:) -- Doubly Linked List -- Append -- Remove Node Method -- Remove(at:) -- Summary -- Chapter 7: Hash Table -- Creating Hash Table -- Retrieving Data from a Hash Table -- Updating a Value in a Hash Table -- Removing a Value from a Hash Table -- Summary -- Chapter 8: Trees -- Creation -- Insertion -- Searching Data -- Conclusion -- Chapter 9: Trie Data Structure -- Why a Trie? -- How It Works -- Implementation -- Insert -- Query -- Remove -- Conclusion 
505 8 |a Chapter 10: Binary Tree -- Binary Tree Primer -- Properties of Binary Tree -- Types of Binary Trees -- Implementation -- Tree Traversal (Also Known As Tree Search) -- In-Order Traversal -- Pre-Order Traversal -- Post-Order Traversal -- Conclusion -- Chapter 11: Binary Search Tree -- Implementation -- Insert -- Search -- Example -- Delete -- Deleting a Leaf -- Deleting a Node with One Child -- Deleting a Node with Two Children -- Conclusion -- Chapter 12: Red-Black Tree -- Implementation -- Rotation -- Insertion -- Deletion -- Conclusion -- Chapter 13: Big O -- Time Complexity -- Space Complexity 
505 8 |a Drop the Constants and Nondominant Terms -- How to Calculate Complexities? -- Add vs. Multiply -- Amortized Time -- Log N Runtimes -- Recursive Runtimes -- Conclusion -- Chapter 14: Sorting Algorithms -- Bubble Sort -- Implementation -- Selection Sort -- Implementation -- Insertion Sort -- Implementation -- Merge Sort -- Implementation -- Quick Sort -- Implementation -- Pivot Selection -- Conclusion -- Chapter 15: Search Algorithms -- Linear Search -- Implementation -- Binary Search -- Implementation -- Conclusion -- Chapter 16: Graph Algorithms -- Directed Graphs -- Undirected Graphs 
500 |a Weighted Graphs 
504 |a Includes index. 
520 |a Control the performance and stability of the apps you develop in Swift by working with and understanding advanced concepts in data structures and algorithms. All professional developers have to know which data structure and algorithms to use in their development process. Your choice directly affects the performance of your application. With this book, youll increase the performance of your software, become a better developer, and even pass tricky interview questions better when looking at professional development opportunities. Guided by compact and practical chapters, you'll learn the nature and proper use of data structures such as arrays, dictionaries, sets, stacks, queues, lists, hash tables, trie, heaps, binary trees, red black trees, and R-trees. Use the main differences among them to determine which will make your applications efficient and faster. Then tackle algorithms. Work with Big O notation; sorting algorithms such as Insertion, Merge, and Quick; Naive and Rabin Karp algorithms; and Graph Algorithms. Data Structures and Algorithms in Swift encourages you to further and understand how to best choose the perfect algorithm for your applications needs. You will: Retrieve, add, and remove elements in arrays Implement stacks, queues, and lists in your apps Sort algorithms and choose the best ones for your apps. 
590 |a O'Reilly  |b O'Reilly Online Learning: Academic/Public Library Edition 
650 0 |a Swift (Computer program language) 
650 0 |a Data structures (Computer science) 
650 0 |a Application software  |x Development. 
650 6 |a Swift (Langage de programmation) 
650 6 |a Structures de données (Informatique) 
650 6 |a Logiciels d'application  |x Développement. 
650 7 |a Application software  |x Development  |2 fast 
650 7 |a Data structures (Computer science)  |2 fast 
650 7 |a Swift (Computer program language)  |2 fast 
776 0 8 |i Print version:  |a Karimov, Elshad.  |t Data Structures and Algorithms in Swift : Implement Stacks, Queues, Dictionaries, and Lists in Your Apps.  |d Berkeley, CA : Apress L.P., ©2020  |z 9781484257685 
856 4 0 |u https://learning.oreilly.com/library/view/~/9781484257692/?ar  |z Texto completo (Requiere registro previo con correo institucional) 
938 |a Askews and Holts Library Services  |b ASKH  |n AH37404346 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL6146446 
938 |a EBSCOhost  |b EBSC  |n 2405058 
938 |a YBP Library Services  |b YANK  |n 16713819 
994 |a 92  |b IZTAP