Self-Made-Projects
A list of projects made by me. Several other projects have been initiated and still under pipeline.
Some of the most interesting and successful projects were made in an attempt to have "fun" such as - A* Search Algorithm, Minesweeper, Tic-Tac-Toe etc.
Many of these projects are aimed to "play" with unconventional data structures (like- Cartesian Tree, Sparse Set) and some of them are "serious" algorithms designed just to get a slight performance edge over the existing popular algorithms (like- Tarjan Offline Least Common Ancestor Algorithm whose analysis involves inverse Ackermann function).
These projects won me the title of Geek of the Month, for June 2016 given by GeeksforGeeks
These projects were successfully implemented continuously from [February 2016 - Current] and published on GeeksforGeeks
These projects were implemented, tested and compiled together by Rachit Belwariar.
One can also find all my Test Case Generator Programs and Sample Test Cases here
1. Requirements - Any C/C++ Compiler would work.
2. Design - The projects are well commented and each project is accompanied with its respective Project Manual for convenience of the readers.
Also read the Description.md file associated with all the projects to get the link to the published projects.
3. Implementation - All projects are implemented using C/C++. I have planned to implement them in other languages like-Python in near future.
4. Testing/Debugging - Several tests have been run on all the projects by generating random test cases. The test-case generators are included with their respective projects.
One can also find all my Test Case Generator Programs and Sample Test Cases here
Note- Minesweeper and Tic-Tac-Toe have in-built test case generators. Hence no test case generators have been included with them.
5. Maintenance -The projects are maintained from time to time. Majority of my projects have been published on GeeksforGeeks and is always at check by the heavy traffic of its readers.
Any suggestions to improve the projects are welcome on gbelwariar@gmail.com or can directly send a PR.
Iterative Deepening Depth-First Search(IDDFS)/Iterative Depth-First Search(IDFS)
Longest Common Prefix(LCP) - Character-by-Character Matching
还没有评论,说两句吧!
热门资源
seetafaceJNI
项目介绍 基于中科院seetaface2进行封装的JAVA...
spark-corenlp
This package wraps Stanford CoreNLP annotators ...
Keras-ResNeXt
Keras ResNeXt Implementation of ResNeXt models...
capsnet-with-caps...
CapsNet with capsule-wise convolution Project ...
inferno-boilerplate
This is a very basic boilerplate example for pe...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com