Please use this identifier to cite or link to this item:
http://dspace.azjhpc.org/xmlui/handle/123456789/209
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gasimzadeh, Kenan | - |
dc.date.accessioned | 2023-12-16T20:22:13Z | - |
dc.date.available | 2023-12-16T20:22:13Z | - |
dc.date.issued | 2023-05-11 | - |
dc.identifier.uri | http://dspace.azjhpc.org/xmlui/handle/123456789/209 | - |
dc.description.abstract | Count sort is a sorting algorithm that sorts the elements of an array in logical order, counting the number of times that each unique element exists in the array, and can be used mostly in cases where the range of values in the input array is relatively small compared to the size of the array. We will talk about its disadvantages, 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 | Countıng Algorıthm | en_US |
dc.subject | correct sorted position | en_US |
dc.subject | digital signal | en_US |
dc.title | Countıng algorıthm of e-educatıon based on modern technologıes | 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 | 120 | en_US |
dc.source.endpage | 122 | en_US |
dc.source.numberofpages | 3 | 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-120-122.pdf | 273.25 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.