Abstract
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.
Cite
CITATION STYLE
APA
Jain, A., Saini, M., & Kumar, M. (2015). Greedy Algorithm. Journal of Advance Research in Computer Science & Engineering (ISSN: 2456-3552), 2(4), 11015. https://doi.org/10.53555/nncse.v2i4.451
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free