xxks-kkk / algo Goto Github PK
View Code? Open in Web Editor NEW:notebook: End-chapter solution for <Data Structures and Algorithm Analysis in C (2nd Edition)> by Mark Allen Weiss
License: MIT License
:notebook: End-chapter solution for <Data Structures and Algorithm Analysis in C (2nd Edition)> by Mark Allen Weiss
License: MIT License
Implementation for <Data Structures and Algorithm Analysis in C (2nd Edition)> by Mark Allen Weiss Solution coverage: [Chapter 3] 3.1, 3.2, 3.3, 3.4, 3.5, 3.6, 3.7.a;b;d, 3.8, 3.9, 3.10, 3.11, 3.12, 3.13, 3.15, 3.17, 3.18.b;c, 3.19, 3.20, 3.21, 3.22.a, 3.23, 3.25, 3.26 [Chapter 4] 4.10, 4.18, 4.19, 4.20, 4.22, 4.27, 4.28, 4.29, 4.30, 4.31, 4.32, 4.35, 4.37.a, 4.40, 4.41, 4.42, 4.44, 4.45, 4.46.b;c [Chapter 5] 5.3, 5.11.d [Chapter 6] 6.4, 6.5, 6.11, 6.15.a;b;c;d, [Chapter 7] 7.14
There are two TODOs left out in #10
For MAW 3.19 & 3.20, we deal with postfix expression. For MAW 3.19, we put integer onto the stack but for MAW 3.20, we put char onto the stack. Due to this, I have to split them into different module: one in "stack/generic" and "stack/postfix", which are not great way to organize the code.
I manually test the functionality of pop
a stack when it is empty. In this situation, pop
should return an error, which it does. However, if I actually put this situation under my test main program, the following test cannot carry on because I fatal
will do exit(-1)
.
I need to find a way to allow testing those error handling situations while the rest of test cases can still carry on.
Eventually I need a test framework to properly test this repo.
I have implemented basic but definitely buggy extendible hashing. See the branch with name "extendible-hashing". However, due to the time constraint, polish it may take 2-3 days and I'm not going to do it in my first iteration.
This relates to 4.37.b;c, 4.38
Transform a BST "T1" to another BST "T2" through AVL single rotations.
I need a bld
script to wrap around makefile(s) to have more control on how I want to build the project. This bld
script should be developed using Perl.
I need to have a utility module that offer the routines to be used across different data structure module
CSPT delete(ET elem, CSPT T);
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.