Please use this identifier to cite or link to this item: http://dspace.azjhpc.org/xmlui/handle/123456789/209
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGasimzadeh, Kenan-
dc.date.accessioned2023-12-16T20:22:13Z-
dc.date.available2023-12-16T20:22:13Z-
dc.date.issued2023-05-11-
dc.identifier.urihttp://dspace.azjhpc.org/xmlui/handle/123456789/209-
dc.description.abstractCount 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.isoenen_US
dc.publisherAzərbaycan Dövlət Neft və Sənaye Universitetien_US
dc.subjectCountıng Algorıthmen_US
dc.subjectcorrect sorted positionen_US
dc.subjectdigital signalen_US
dc.titleCountıng algorıthm of e-educatıon based on modern technologıesen_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.beginpage120en_US
dc.source.endpage122en_US
dc.source.numberofpages3en_US
Appears in Collections:1st INTERNATIONAL CONFERENCE ON THE 4th INDUSTRIAL REVOLUTION AND INFORMATION TECHNOLOGY

Files in This Item:
File Description SizeFormat 
Industy_4-120-122.pdf273.25 kBAdobe PDFView/Open


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