• Computer Science
  • Published 2003

Comparison Of Algorithm Complexity Using Big-O Notation and Runtime Analysis (A Case Study of Shell Sort Quicksort and Fibonacci Sequence)

@inproceedings{Adebisi2003ComparisonOA,
  title={Comparison Of Algorithm Complexity Using Big-O Notation and Runtime Analysis (A Case Study of Shell Sort Quicksort and Fibonacci Sequence)},
  author={Temitope Yusuf Yusuf Adebisi},
  year={2003}
}
The issue of algorithm complexity has become a major phenomenon in the computer science area of study. Here was consider two sorting algorithm (namely, shellsort and quicksort) and a recurrence algorithm (namely, Fibonacci sequence). We compare the complexity of the sorting algorithms with the performance evaluation on the following cases: Best Case, Average Case and Worst Case. Data was supplied by considering the array size input for the Best case, Average case and Worst case. The input size… CONTINUE READING

Topics from this paper.