I’m a Software Engineering Undergraduate at Informatics Institute of Technology(IIT), affiliated to the University of Westminster.Tech entrepreneur and Blog article writer. You can find more about me, my thoughts and my knowledge from this space. Please feel free to contact me from following networks if you’d like to connect and join with me.
Moodle is one of the most prestigious and widely-used Free and Open Source Learning Platform in the world today, and has great community support. To get to know basic understanding I followed the guidelines which were mentioned in the Moodle website for GSOC participants.
The beginning of GSOC 2016 ,was a dream which was out of reach for me. But with commitment, passion and guidance from my university lecturer Mr.Guhanathan Poravi he always motivated us about GSOC and past Gsocers in my university Roshan,Kasun and Ashan no word can express my gratefulness for all of you, I was able to finally make it a reality.
When I was in first year(2015) I had heard about that word “GSOC” from my colleagues and just tried to find more details. There was a “GSOC awareness session” organized by past Gsocers in my university and had a chance to get some idea. I just thought its only for the elite programmers but finally I thought “nope , I should try at least”.
If we have an ordered list and we know how many things are in the list (i.e., number of records in a file), we can use a different strategy. • The binary search gets its name because the algorithm continually divides the list into two parts.
Definition: An algorithm is a clearly specified set of simple instructions to be followed to solve a problem. Once an algorithm is given for a problem and decided to be correct, an important step is to determine how much in the way resources, such as time or space (memory) the algorithm will require.
Actually there’s no too many functionalities when we analysing an algorithm. But some specific properties help us to classify the performance of algorithms properly. These functions describe the order of growth of a large number of algorithms