Coursera_data_structures

介绍DCE RPC的实现机制，以及DCOM如何与DCE RPC绑定，内容对于理解和实现DCOM runtime lib具有重要参考价值。

an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses.

CSE-247-数据结构和算法

gn算法matlab代码 :herb: 先进的数据结构 JavaScript中数据结构的游乐场。 这是的子项目，是的双子项目。 :newspaper: 描述 该自述文件重新组合了许多项目，这些项目侧重于使用JavaScript实现数据结构。 该项目本身不包含任何代码。 :baby: 孩子们 :oden: 顺序 ：JavaScript的列表规范 数组 ：JavaScript的动态数组数据结构 双端队列 :snake: ：适用于JavaScript的Python的双端队列数据结构 链表 :oden: ：JavaScript的双链表数据结构 :red_paper_lantern: ：JavaScript的单链列表数据结构 :repeat_button: ：JavaScript的循环链表数据结构 :blossom: ：JavaScript的先进先出数据结构 堆栈 :soft_ice_cream: ：JavaScript的后进先出数据结构 :person_juggling: 保持优先 :fallen_leaf: 堆 ：JavaScript的堆数据结构 ：JavaScript中堆数据结构的规范 ：Python的Java的heapq库 ：针对Javascript的堆排序算法 :cherries: ：JavaScript的二项式堆数据结构 ：JavaScript的d-ary堆数据结构 :cherries: ：JavaScript的配对堆数据结构 :spiral_shell: ：JavaScrip

learned index

C语言中的算法和DS：C中算法和DS的简单实现

data structures and algorithms in c++ mark allen weiss 第三版 扫描版

"Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry.The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues,Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms [Medians], Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts. Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in C/C++ language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems. What is unique? Our main objective isn't to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities. Topics Covered: Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queue and Heaps Disjoint Sets ADT Graph Algori

通过耦合ABAQUS和DIGIMAT，开发了两种尺度的程序(宏观层面的有限元和微观层面的均匀化)。将给出一些应用来说明DIGIMAT作为输入的描述材料微观结构的参数与ABAQUS预测的全局响应之间的联系