Cantitate/Preț
Produs
Total produse
Vezi coșul
Data Structures and Algorithms in Swift: Implement Stacks, Queues, Dictionaries, and Lists in Your Apps de Elshad Karimov

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

Autor Elshad Karimov
en Limba Engleză Paperback – 26 mar 2020
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. What You'll Learn

  • 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

Who This Book Is For

Developers who have intermediate knowledge in Swift and want to improve their code performance and pass more complex interviews
Citește tot Restrânge

Preț: 33258 lei

Preț vechi: 41572 lei
-20% Nou

Puncte Express: 499
Preț estimativ în valută:
6364€ • 6661$ • 5297£

Carte tipărită la comandă

Livrare economică 27 martie-02 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781484257685
ISBN-10: 1484257685
Pagini: 195
Ilustrații: XIII, 208 p. 95 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.32 kg
Ediția:1st ed.
Editura: Apress
Colecția Apress
Locul publicării:Berkeley, CA, United States

Cuprins

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.

Notă biografică

Elshad Karimov is an experienced programmer with a solid background in iOS development as well as Oracle, SQL, C#, Java, and HTML/CSS. He's familiar with the performance limits and characteristics of Swift and the nature and function of embedded databases and system datastores.

Textul de pe ultima copertă

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

Caracteristici

Work with the right data structure and algorithms for your app Increase the performance of your software with arrays, sets, dictionaries, and algorithms Pass more complex interviews with advanced knowledge of data structures