descriptionPublicationkeyboard_double_arrow_right Article 01 Oct 2013 English Publisher:Walter de Gruyter GmbHJournal:Journal of Artificial Intelligence and Soft Computing Research, volume 3, pages 251-263 (eissn: 2083-2567,

Authors: Alina Martnez Oropeza; Marco Antonio Cruz Chvez;

doi: 10.2478/jaiscr-2014-0018

B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem

- Summary
- Metrics

Abstract

Abstract This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP). According to the theory, B-TREE Search complexity is lower than Binary Search. The performed experimental tests showed the B-TREE Search Algorithm is more efficient than Binary Search, but only using a dataset larger than 75 students per classroom.

Related Organizations

Universidad Autónoma del Estado de Morelos
Mexico

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average