Homogeneous and Non Homogeneous Algorithms

Details Homogeneous and Non Homogeneous Algorithms Homogeneous and Non Homogeneous Algorithms

2010-08-20

arxiv.org/abs/1008.3546v1

Computer Science

Data Structures and Algorithms

This (full) paper was accepted for publication in the 13th Panhellenic Conference on Informatics (PCI 2009), 10-12 September 2

Scientific paper

Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous algorithms. Although both classes contain algorithms with worst and best cases, homogeneous algorithms behave uniformly on all instances. This partition clarifies in a completely mathematical way the previously mentioned terms and reveals that in classifying an algorithm as homogeneous or not best case analysis is equally important with worst case analysis.

Affiliated with

Also associated with

No associations

Rating

Homogeneous and Non Homogeneous Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Homogeneous and Non Homogeneous Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homogeneous and Non Homogeneous Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-81330