z-logo
open-access-imgOpen Access
Greedy Algorithm
Author(s) -
Abhishek Jain,
Manjeet Saini,
M. Rahul Kumar
Publication year - 2015
Publication title -
journal of advance research in computer science and enigneering
Language(s) - English
Resource type - Journals
ISSN - 2456-3552
DOI - 10.53555/nncse.v2i4.451
Subject(s) - greedy algorithm , computer science , algorithm , efficient algorithm , property (philosophy) , resource consumption , mathematical optimization , mathematics , ecology , philosophy , epistemology , biology
This paper describes the basic technological aspects of algorithm, algorithmic efficiency and Greedy algorithm. Algorithmic efficiency is the property of an algorithm which relate to the amount of resources use by the algorithm in computer sciences. An algorithm is considered efficient if its resource consumption (or computational cost) is at or below some acceptable level.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here