AN INTRODUCTION TO TIME COMPLEXITY AND NP-COMPLETE

  • Upender Yadav Dronacharya college of engineering
  • Vikash Verma Dronacharya college of engineering
  • Parmod Saha Dronacharya college of engineering
DOI: https://doi.org/10.53555/cse.v1i4.748
Keywords: Algorithm analysis, Sorting algorithm, Computational Complexity notation

Abstract

The time complexity of an algorithm is the amount of computer time required by an algorithm to run to completion. Computational time complexity analyzes of evolutionary algorithms (EAs) have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the (1+1)-EA, on toy problems. The objective of this paper is to review the time complexity knowledge seen in research work devoted on synthesis, optimization, and effectiveness of various sorting algorithms. We will examine different sorting algorithms in the lines and try to discover the tradeoffs between them

Downloads

Download data is not yet available.
Published
2015-04-30
How to Cite
Yadav, U., Verma, V., & Saha, P. (2015). AN INTRODUCTION TO TIME COMPLEXITY AND NP-COMPLETE. IJRDO -Journal of Computer Science Engineering, 1(4), 230-239. https://doi.org/10.53555/cse.v1i4.748
Issue
Vol. 1 No. 4 (2015): IJRDO - Journal of Computer Science Engineering
Section
Articles

Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.