國立虎尾科技大學 |

Data Structures and Algorithms in Swift = Implement Stacks, Queues, Dictionaries, and Lists in Your Apps /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Data Structures and Algorithms in Swift/ by Elshad Karimov.
Reminder of title:	Implement Stacks, Queues, Dictionaries, and Lists in Your Apps /
Author:	Karimov, Elshad.
Description:	XIII, 208 p. 95 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Apple computer. -
Online resource:	https://doi.org/10.1007/978-1-4842-5769-2
ISBN:	9781484257692

Data Structures and Algorithms in Swift = Implement Stacks, Queues, Dictionaries, and Lists in Your Apps /
Karimov, Elshad.

Data Structures and Algorithms in SwiftImplement Stacks, Queues, Dictionaries, and Lists in Your Apps /[electronic resource] :by Elshad Karimov. - 1st ed. 2020. - XIII, 208 p. 95 illus.online resource.

Chapter 1: Arrays -- Chapter 2: Dictionaries -- Chapter 3: Sets -- Chapter 4: Stacks -- Chapter 5: Queue -- Chapter 6: Linked Lists -- Chapter 7: Hash Tables -- Chapter 8: Trees -- Chapter 9: Trie Data Structures -- Chapter 10: Binary Tree -- Chapter 11: Binary Search Tree -- Chapter 12: Red Black Tree -- Chapter 13: Big O -- Chapter 14: Sorting Algorithms -- Chapter 15: Search Algorithms -- Chapter 16: Graph Algorithms -- Chapter 17: Choosing the Best Algorithm.

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, you’ll 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 application’s 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.

ISBN: 9781484257692

Standard No.: 10.1007/978-1-4842-5769-2doiSubjects--Topical Terms:

909025
Apple computer.

LC Class. No.: QA76.8.M3

Dewey Class. No.: 004.165

Data Structures and Algorithms in Swift = Implement Stacks, Queues, Dictionaries, and Lists in Your Apps /
LDR:03210nam a22004095i 4500 001 1023410
003 DE-He213
005 20200706040411.0
007 cr nn 008mamaa
008 210318s2020 xxu| s |||| 0|eng d
020 $a 9781484257692 $9 978-1-4842-5769-2
024 7 $a 10.1007/978-1-4842-5769-2 $2 doi
035 $a 978-1-4842-5769-2
050 4 $a QA76.8.M3
050 4 $a QA76.774.I67
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 004.165 $2 23
100 1 $a Karimov, Elshad. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1319330
245 1 0 $a Data Structures and Algorithms in Swift $h [electronic resource] : $b Implement Stacks, Queues, Dictionaries, and Lists in Your Apps / $c by Elshad Karimov.
250 $a 1st ed. 2020.
264 1 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2020.
300 $a XIII, 208 p. 95 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Chapter 1: Arrays -- Chapter 2: Dictionaries -- Chapter 3: Sets -- Chapter 4: Stacks -- Chapter 5: Queue -- Chapter 6: Linked Lists -- Chapter 7: Hash Tables -- Chapter 8: Trees -- Chapter 9: Trie Data Structures -- Chapter 10: Binary Tree -- Chapter 11: Binary Search Tree -- Chapter 12: Red Black Tree -- Chapter 13: Big O -- Chapter 14: Sorting Algorithms -- Chapter 15: Search Algorithms -- Chapter 16: Graph Algorithms -- Chapter 17: Choosing the Best Algorithm.
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, you’ll 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 application’s 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.
650 0 $a Apple computer. $3 909025
650 1 4 $a Apple and iOS. $3 1115030
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9781484257685
776 0 8 $i Printed edition: $z 9781484257708
856 4 0 $u https://doi.org/10.1007/978-1-4842-5769-2
912 $a ZDB-2-CWD
912 $a ZDB-2-SXPC
950 $a Professional and Applied Computing (SpringerNature-12059)
950 $a Professional and Applied Computing (R0) (SpringerNature-43716)