amrsmind Goto Github PK

adaptive-hufman-

java adaptive hufman compression

aisec-applicant-info

retrieve the latest 11 applicants info into a table from aisec API on the server. #php #API

amrsmind.github.io

analyze-selection-quick-and-shell-sort

using c++ ........ plotted performance

b.rectangles-codeforces-

http://codeforces.com/contest/844/problem/B

basic-react-files-for-wordpress

Required files to create a react app with JSX.

big-integer-decimal-holds-unlimited-size-c-

In c++ integers are usually limited by minimum and maximum values. Sometimes it is desired to have versions of these types with unlimited bounds. Java solves this problem by providing BigInteger and BigDecimal classes. we will develop a new C++ type (negative or positive) and we can do all the arithmitic operations on them.

binary-search-avl-tree-

blockchain

#java #blockChain

c.two-tvs-code-forces-

checking-tree-balance-

Using c++ check if the binary search tree is balanced or not

cli-

command line #java

converting-degrees-

#dynamic #js #react

cpu-schedulers-simulator

#java

d-vessels-code-forces-

enhanced-insertion-sort-insert-two-items-together-

In this modification, we pick two items at a time. Then we look for the right place of the largest item, shifting items by two places at a time. After putting the largest item in its place, we keep shifting one item at a time till finding the right place for the smallest item. using c++ (plotted performance)

enhanced-insertion-sort-using-binary-seach-instead-of-shifting-

using c++

expo

An open-source platform for making universal native apps with React. Expo runs on Android, iOS, and the web.

fraction-calculator-

a class Fraction that represents a fraction by one integer divided by another, e.g., 1/3 or 3/7. (c++)

gitignore

A collection of useful .gitignore templates

index-builder

The application works by building a binary search tree using BSTFCI and each node contains a word and a vector of that contains the list of lines where this word exists. For each new word, the program finds it and adds the line number to the vector. If word is not found, it is added to the tree. Then traverse the tree in-order to print the nodes. using c++

linkedlist

Linked list class similar to that provided in the C++ STL

login-form-

log in form #react-native #cross-platform

lz78-compression

lz78 compression algorithm by java

lz78-decompression

lz78 decompression algorithm by java

lzw

java lzw Algorithm

masroka

matrix-calculator-

By c++

mobmenu

this is a menu for mob

mounirawy.github.io