e-ISSN:0976-5166
p-ISSN:2231-3850


INDIAN JOURNAL OF COMPUTER SCIENCE AND ENGINEERING

Call for Papers 2020

Apr 2020 - Volume 11, Issue 2
Deadline: 15 Mar 2020
Notification: 15 Apr 2020
Publication: 30 Apr 2020

Jun 2020 - Volume 11, Issue 3
Deadline: 15 Apr 2020
Notification: 15 Jun 2020
Publication: 30 Jun 2020

More

Indexed in

IJCSE Indexed in Scopus

ABSTRACT

Title : EVALUATING THE REVERSING DATA STRUCTURE ALGORITHM OF LINKED LIST
Authors : Rwan F. Al-Rashed, Atheer S. Al-Mutiri, Wadha M. Al-Marrai, Badriayh G. Al-Mutiri, Hanan F. Al-Qahtani, Jehan A. Al-Buainain, Hanaa F. Morse, Enas E. El-Sharawy
Keywords : data structure, single linked list, recursion, iteration, reversing ways
Issue Date : Jan-Feb 2020
Abstract :
Rapid development has enabled the production of advanced and important data structures in the programming world, and one of the most important structures of it is "single linked list", that have many features and advantages but it has some problems. One of these problems reversing data in it. Through our aspirations for previous studies, we found that this problem has two ways to solve, namely "Recursion and Iteration", but was our basic goal in this research comparing between these two ways, who is better? Who is way are more efficient?. One of the most common results we found in is: iteration is simpler and less complex than the recursion method, but recursive of the codes we created, we found that they give better results and fewer lines, though its main idea more complex than iteration, and by mathematical analysis of results: lines of codes in iteration 46 but in recursive, there is no big difference 44, Effective line of code in recursive 36 but in iteration was 38, and logical line of code in iteration 30 but in recursive 28, total cyclo complexity in all of them: 6, total function complex in recursive equals 16 but in iteration equals 14.
Page(s) : 57-65
ISSN : 0976-5166
Source : Vol. 11, No.1
PDF : Download
DOI : 10.21817/indjcse/2020/v11i1/201101070