JURNAL ILMIAH INFOKOM
Vol 6 No 1 (2018): JURNAL INFOKOM JUNI 2018

RUNNING TIME ALGORITHM SEARCHING DATA IN ONE DIMENSION ARRAY USING JAVA NETBEANS

jOHNSON SIHOMBING (Politeknik Piksi Ganesha)

Article Info

Publish Date
18 Jun 2018

Abstract

Data search algorithms are often used in any programming consisting of: sequentialsearching, binary searching and interpolation searching.Search data can be done in an array, either one-dimensional array, two dimensional andeven n-dimensional. For the research, the author only do the implementation of searchalgorithm on a one dimensional array that each data element is numeric type.The search process is performed on consecutive and non-sequential data in the array.Unassisted data can be found in sequential searches. The opposite is true for binarysearch and interpolation search.The purpose of implementing the algorithm is to show the difference of the result of therunning time of the three search algorithms above, which can be visualized in graphicalform.The results are obtained after the authors perform the implementation of searchalgorithm by using a desktop-based Java software with editor or compiler Netbeans 8.1.

Copyrights © 2018




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
605.568 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
JURNAL ILMIAH INFOKOM
Website

Abbrev

INFOKOM

Publisher

Politeknik Piksi Ganesha Indonesia

Subject

Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering

Description

Computer Science, Artificial Intelligency, Cyber Ethnic, E-Commerce, E-Government, E-Learning, Cloud Computing, Information Technology, Information System, Software Engineering, Architecture Enterprise, Database, Data Mining, Data Security, Network Engineering, Network ...