Abstract
The search system is a feature that is indispensable for an application or website. By comparing two algorithms that are often used, namely Binary Search and Regular Search Expression (REGEX) algorithms in a simple search system is a problem that will be discussed in this journal. Analysis of the two algorithms is carried out to solve problems in the search system so that the search algorithm can be applied more precisely and effectively. The results prove that the Binary Search has the advantage of searching large amounts of data in an ordered state and has a more effective iteration. While the Regular Expression Search has the advantage of performing searches that are not completely known about the results and keys, besides that this algorithm also allows you to search based on certain patterns in the data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: METHOMIKA Jurnal Manajemen Informatika dan Komputerisasi Akuntansi
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
