Glyps for Data Structures and Algorithms
Graph – We can represent the content of this blog in a word graphs , connecting each other or connecting all the blogs.
Divide and Conquer – While reading the contents of GUVI you can divide the contents in my small segments and learn them one by one or recursively.
Recursion – You can read a blogs and goto the links mentioned in that blog and traverse the links represented in the blogs till you feel its clear to stop and traverse back to GUVI blogs.
Array – You can list all the blog titles in an array so that you can sort the titles alphabetically.
Brute Force – Trying to randomly type the blog title in the address bar and trying to fetch the page.
BackTracking – While going into the links recursively or breath wise your have to keep track of your path so that you can comeback to the starting point and branch as and when needed.
Guys I am tired..help me plz … Give more examples in comments .
For more blogs and problems visit http://www.guvi.in or mail to me [email protected]
Binary tree or Double linked list (not in image) – Previous and next posts with respect to current post
Stack – Home page of the blog where recently added post at the top
Set – Labeling the posts belong to different sets.
Brute Force example is not convincing. I don’t think fetching a page is done by brute force method.
One example I can think of is, using brute force method for solving very hard sudoku.
For very hard sudoku, I will choose a number for a cell by calculated guess and continue to fill other cells. If that didn’t work then will revert and make another guess and so on.
Priority Queue : You can read/go through the blogs one by one in the order of blog with highest interest first and lowest interest at the end. Here interest rating (priority) decides whether the given blog takes a higher position compared to another blog.
Thanks a lot very much for the high quality and results-oriented help.