Please use this identifier to cite or link to this item: http://dspace.azjhpc.org/xmlui/handle/123456789/250
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZaidov, Chingiz-
dc.date.accessioned2023-12-17T11:56:36Z-
dc.date.available2023-12-17T11:56:36Z-
dc.date.issued2023-05-11-
dc.identifier.urihttp://dspace.azjhpc.org/xmlui/handle/123456789/250-
dc.description.abstractIn computer science, a binary search algorithm is an algorithm designed to solve a search problem. Algorithms often evaluated by computational complexity or maximum theoretical runtime. In this article, we will talk about the basics of binary search, its working principle, advantages, shortcomings, comparison with other algorithms and areas of application.en_US
dc.language.isoenen_US
dc.publisherAzərbaycan Dövlət Neft və Sənaye Universitetien_US
dc.subjectbinaryen_US
dc.subjectalgorithmen_US
dc.subjecttechnologiesen_US
dc.subjecte-educationen_US
dc.titleBinary search algorithm of e-education based on modern technologiesen_US
dc.typeBooken_US
dc.source.journaltitle1st INTERNATIONAL CONFERENCE ON THE 4th INDUSTRIAL REVOLUTION AND INFORMATION TECHNOLOGYen_US
dc.source.booktitle1st INTERNATIONAL CONFERENCE ON THE 4th INDUSTRIAL REVOLUTION AND INFORMATION TECHNOLOGYen_US
dc.source.volume1en_US
dc.source.issue1en_US
dc.source.beginpage185en_US
dc.source.endpage188en_US
dc.source.numberofpages4en_US
Appears in Collections:1st INTERNATIONAL CONFERENCE ON THE 4th INDUSTRIAL REVOLUTION AND INFORMATION TECHNOLOGY

Files in This Item:
File Description SizeFormat 
Industy_4-185-188.pdf266.77 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.