Data structures and algorithms in Swift : implement stacks, queues, dictionaries, and lists in your apps /: implement stacks, queues, dictionaries, and lists in your apps. (2020)
- Record Type:
- Book
- Title:
- Data structures and algorithms in Swift : implement stacks, queues, dictionaries, and lists in your apps /: implement stacks, queues, dictionaries, and lists in your apps. (2020)
- Main Title:
- Data structures and algorithms in Swift : implement stacks, queues, dictionaries, and lists in your apps
- Further Information:
- Note: Elshad Karimov.
- Other Names:
- Karimov, Elshad
- Contents:
- 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 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 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 TableIntro -- 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 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 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 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 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 … (more)
- Publisher Details:
- Berkeley, CA : Apress L.P
- Publication Date:
- 2020
- Extent:
- 1 online resource (215 pages)
- Subjects:
- 005.13/3
Swift (Computer program language)
Data structures (Computer science)
Application software -- Development
Application software -- Development
Data structures (Computer science)
Swift (Computer program language)
Electronic books
Electronic books - Languages:
- English
- ISBNs:
- 9781484257692
1484257693 - Related ISBNs:
- 9781484257685
1484257685 - Notes:
- Note: Print version record.
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.506298
- Ingest File:
- 03_081.xml