Computer Science - Sorting & Searching Algorithm Book下载

weixin_39821228 2020-04-20 08:00:25

Computer Science - Sorting & Searching Algorithm Book
相关下载链接：//download.csdn.net/download/morre/388015?utm_source=bbsseo

...全文

18 回复打赏收藏转发到动态举报

写回复

用AI写文章

切换为时间正序

请发表友善的回复…

发表回复

Computer Science - Sorting & Searching Algorithm Book

Title: Problem Solving in Data Structures & Algorithms Using Java: The Ultimate Guide to Programming Author: Hemant Jain Length: 436 pages Edition: First Edition Language: English Publisher: CreateSpace Independent Publishing Platform Publication Date: 2016-10-21 ISBN-10: 1539724123 ISBN-13: 9781539

Algorithms in C++, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching(3rd Edition)英文版

Title: Problem Solving in Data Structures & Algorithms Using C++: Programming Interview Guide Language: English Publisher: CreateSpace Independent Publishing Platform Publication Date: 2017-01-08 ISBN-10: 1542396476 ISBN-13: 9781542396479 This book is about the usage of data structures and algorithms in computer programming. Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Adobe and many others are looking for in an interview. This book assumes that you are a C++ language developer. You are not an expert in C++ language, but you are well familiar with concepts of references, functions, arrays and recursion. In the start of this book, we will be revising the C++ language fundamentals that will be used throughout this book. We will be looking into some of the problems in arrays and recursion too. Then in the coming chapter, we will be looking into complexity analysis. Then will look into the various data structures and their algorithms. We will be looking into a linked list, stack, queue, trees, heap, hash table and graphs. We will be looking into sorting, searching techniques. Then we will be looking into algorithm analysis, we will be looking into brute force algorithms, greedy algorithms, divide and conquer algorithms, dynamic programming, reduction, and backtracking. In the end, we will be looking into the system design that will give a systematic approach for solving the design problems in an Interview.

This book is about the usage of data structures and algorithms in computer programming. Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Adobe and many others are looking for in an interview. This book assumes that you are a C++ language developer. You are not an expert in C++ language, but you are well familiar with concepts of references, functions, arrays and recursion. In the start of this book, we will be revising the C++ language fundamentals that will be used throughout this book. We will be looking into some of the problems in arrays and recursion too. Then in the coming chapter, we will be looking into complexity analysis. Then will look into the various data structures and their algorithms. We will be looking into a linked list, stack, queue, trees, heap, hash table and graphs. We will be looking into sorting, searching techniques. Then we will be looking into algorithm analysis, we will be looking into brute force algorithms, greedy algorithms, divide and conquer algorithms, dynamic programming, reduction, and backtracking. In the end, we will be looking into the system design that will give a systematic approach for solving the design problems in an Interview. Table of Contents CHAPTER 1: INTRODUCTION - PROGRAMMING OVERVIEW CHAPTER 2: ALGORITHMS ANALYSIS CHAPTER 3: APPROACH TO SOLVE ALGORITHM DESIGN PROBLEMS CHAPTER 4: ABSTRACT DATA TYPE & C++ COLLECTIONS CHAPTER 5: SEARCHING CHAPTER 6: SORTING CHAPTER 7: LINKED LIST CHAPTER 8: STACK CHAPTER 9: QUEUE CHAPTER 10: TREE CHAPTER 11: PRIORITY QUEUE CHAPTER 12: HASH-TABLE CHAPTER 13: GRAPHS CHAPTER 14: STRING ALGORITHMS CHAPTER 15: ALGORITHM DESIGN TECHNIQUES CHAPTER 16: BRUTE FORCE ALGORITHM CHAPTER 17: GREEDY ALGORITHM CHAPTER 18: DIVIDE-AND-CONQUER, DECREASE-AND-CONQUER CHAPTER 19: DYNAMIC PROGRAMMING CHAPTER 20: BACKTRACKING AND BRANCH-AND-BOUND CHAPTER 21: COMPLEXITY THEORY AND NP COMPLETENESS CHAPTER 22: INTERVIEW STRATEGY CHAPTER 23: SYSTEM DESIGN

下载资源悬赏专区

13,656

社区成员

12,675,095

社区内容

发帖

与我相关

我的任务

其他技术论坛（原bbs）

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

暂无公告

试试用AI创作助手写篇文章吧

+ 用AI写文章