<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

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

CIICAp, Universidad Autnoma del Estado de Morelos Av. Universidad 1001. Col. Chamilpa, C.P. 62209. Cuernavaca, Morelos, Mxico

Journal of Artificial Intelligence and Soft Computing Research

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to...

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

Data publikacji: 30 gru 2014

Zakres stron: 251 - 263

DOI: https://doi.org/10.2478/jaiscr-2014-0018

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.