ContentsBresenham’s Line AlgorithmDecision VariableHow It WorksExample : Lets take an exampleImplementation in C Bresenham’s Line Algorithm The basic aim of this algorithm is to find out the best raster locations to represent the straight lines. Decision Variable The Bresenham’s line algorithm is done by increment either x or y by one unit depending on slope Full Article…
Search the Wiki
Viewing 1 to 5 of 5 items
Ternary Search Trees : Efficient way to store Strings
ContentsWhat is Ternary Search Tree ?Why Ternary search trees ?Ternary Search Trees Node DeclarationInsertion of string in Ternary Search TreesExample to Show how actually Inserting function works. What is Ternary Search Tree ? Ternary Search Tree is a Data Structure to store strings , Ternary search Tree combines the advantage of memory or space efficiency of BSTs Full Article…
Recursion and use of recursion over iteration
What is recursion? A function which call itself again and again is called Recursive function. In recursion a problem calls a copy of itself to work on a smaller problem.It is important to have a termination step in recursion . In short we can say that recursive program call itself with a smaller version of Full Article…
| PHP Error Message |
Fatal error: Allowed memory size of 67108864 bytes exhausted (tried to allocate 40961 bytes) in /home/a7821887/public_html/wiki/wp-content/themes/wikeasi/functions/admin-functions.php on line 244