Please use this identifier to cite or link to this item:
http://dspace.azjhpc.org/xmlui/handle/123456789/250
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zaidov, Chingiz | - |
dc.date.accessioned | 2023-12-17T11:56:36Z | - |
dc.date.available | 2023-12-17T11:56:36Z | - |
dc.date.issued | 2023-05-11 | - |
dc.identifier.uri | http://dspace.azjhpc.org/xmlui/handle/123456789/250 | - |
dc.description.abstract | In 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.iso | en | en_US |
dc.publisher | Azərbaycan Dövlət Neft və Sənaye Universiteti | en_US |
dc.subject | binary | en_US |
dc.subject | algorithm | en_US |
dc.subject | technologies | en_US |
dc.subject | e-education | en_US |
dc.title | Binary search algorithm of e-education based on modern technologies | en_US |
dc.type | Book | en_US |
dc.source.journaltitle | 1st INTERNATIONAL CONFERENCE ON THE 4th INDUSTRIAL REVOLUTION AND INFORMATION TECHNOLOGY | en_US |
dc.source.booktitle | 1st INTERNATIONAL CONFERENCE ON THE 4th INDUSTRIAL REVOLUTION AND INFORMATION TECHNOLOGY | en_US |
dc.source.volume | 1 | en_US |
dc.source.issue | 1 | en_US |
dc.source.beginpage | 185 | en_US |
dc.source.endpage | 188 | en_US |
dc.source.numberofpages | 4 | en_US |
Appears in Collections: | 1st INTERNATIONAL CONFERENCE ON THE 4th INDUSTRIAL REVOLUTION AND INFORMATION TECHNOLOGY |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Industy_4-185-188.pdf | 266.77 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.