earticle

논문검색

Statistical Analysis of an Algorithm's Complexity for Linear Equation

원문정보

Chandrashekhar Meshram, Sarita Gajbhiye, Deepak Gupta

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.8 No.2 2015.02 pp.191-198
피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

The present paper, we doing the statistical analysis of insertion sort program and compute its execution times with various parameters. The statistical analysis endorses the specific quadratic pattern of the execution time on the number of items to be sorted. Next, a cursor along the future scope is indicated.

목차

Abstract
 1. Introduction
 2. Statistical Analysis on Experimental Results
 3. Discussion and Conclusion
  3.1. Changing Some System Environment
 References

키워드

저자정보

  • Chandrashekhar Meshram R. T. M. Nagpur University, Nagpur, India Department of WRDM, IIT, Roorkee, India Department of Applied Mathematics Shri Shankaracharya Engineering College, Junwani, Bhilai (C.G.), 490020, India.
  • Sarita Gajbhiye R. T. M. Nagpur University, Nagpur, India Department of WRDM, IIT, Roorkee, India Department of Applied Mathematics Shri Shankaracharya Engineering College, Junwani, Bhilai (C.G.), 490020, India.
  • Deepak Gupta R. T. M. Nagpur University, Nagpur, India Department of WRDM, IIT, Roorkee, India Department of Applied Mathematics Shri Shankaracharya Engineering College, Junwani, Bhilai (C.G.), 490020, India.

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.