CC BY
1MAXSUS SARALASH USULLARI VA ULARDAN FOYDALANISH
Allayorov Saydulla Payziyevich Guliston davlat davlat universiteti dotsenti Islikov Sayid Xalilovich Guliston davlat davlat universiteti Katta o'qituvchisi Komiljonova Lobar Guliston davlat davlat universiteti talabasi e-mail:[email protected] https://doi.org/10.5281/zenodo.11085456
ARTICLE INFO
ABSTRACT
Received: 24th April 2024 Accepted: 25th April 2024 Published: 29th April 2024 KEYWORDS
Bubble sort, Selection sort, Insertion sort, Quick sort, Merge sort, Izlash masalasi, saralash usullari, operativxotira, fayl turi, Total Commander, algoritm, Quiksort
Bugungi maqola algoritmlashning to^rt asosiy yo^nalishlaridan biri hisoblangan saralash algoritmlariga baglshlanadi. Saralash deb, berilgan obyektlar ketma-ketligini malum mantiqiy tartibda qayta joylashtirish jarayoniga aytiladi. Saralash bir necha ko^rsatkichlarga bogliq bolishi mumkin. Misol uchun maktab jismoniy tarbiya darsi. Bu dars boshida bolalar bo^ylariga qarab safda turishadi. Me^yor topshirish jarayonida esa sinf jurnalidagi familyalar ketma-ketligiga qarab topshirishadi. Shu yerning o^zida 2ta saralashdan foydalanilyapti. Biri, boy uzunligi boyicha, ikkinchisi sinf jurnalidagi o^rinlar boyicha.
Sorting is the placement of data in the memory of the machine in a permanent form according to its keys. Here, it is understood that permanence is given in the order of increasing the keys of the data in the array.
Sorting is the ordering of structure elements based on some criteria. A numerical field called a key is usually used as a criterion. If each subsequent key field of the elements is smaller than the previous one, such sorting is said to be sorted in descending order. If each subsequent key field is greater than the previous one, it is called ascending sorting
When processing data, it is necessary to know the information space of the data and its location in the machine.
There are two types of sorting: internal and external: -internal sorting - sorting in RAM; - external sorting - sorting in external memory.
If the records being sorted take up a large amount of memory, then replacing them requires a lot of effort (in terms of time and memory). In order to reduce this cost, sorting is done in the key address table. In this case, only the data pointers are changed, and the array remains in place. This method is called the address table sorting method. During sorting, the same keys
may meet, in this case, after sorting, it is appropriate to leave the same keys in the same order
as they were in the initial order. This method is called static sorting.
Sorting efficiency can be evaluated according to several criteria:
0 qualifying time;
0 RAM required for sorting;
0 time taken to develop the program.
Let's look at the first criterion. The number of comparisons or permutations can be counted
when sorting is done.
Algorithm of sorting by selection
This method is based on the following principles:
1. The element with the smallest key is selected.
2. This element is replaced by the first element.
3. Then this process is repeated with the remaining n-1, n-2 elements until there is only one "biggest" element left.
Bubble sort algorithm
The idea of this method is as follows: n - 1 times the array is compared with pairs of keys going from bottom to top. If the value of the lower key is smaller than the key of the upper pair, then they are exchanged. Quiksort quick sorting algorithm
1. This algorithm is a clear example of the "take and own" principle. This algorithm is recursive and sorts on average N*log2N comparisons. To sort the given array, the algorithm divides it into 2 parts. Select an arbitrary element and divide it into 2 parts. But it is better to select the element in the middle and divide it by 2 from the equal half of the array. Each element to the left and right of the selected key element is compared.
2. From the key element, the smaller ones are moved to the left, and the bigger ones to the right. Now, the same steps as above are repeated on both sides of the array. That is, the elements between these intervals are taken as keys, and so on.
Placement in the Quicksort algorithm
3. We compare the i-element on the left with the key. If the key is small, we go to the next step. Otherwise, i++ and repeat this step.
4. The key is compared with the j-element on the right. If the key is large, we go to the next step, otherwise j--and we repeat this step.
5. i- and j-elements are replaced. If i<=j, it goes to step 3. After the first step, the selected element is placed in its place.
6. Now, if there are elements on the left side of the key in this visible range, the above actions should be performed on them, that is, the visible range is defined as 0 to key-1 and proceed to step 2. Otherwise, it goes to the next step.
7. Now, if there are elements to the right of the key in this visible range, the above operations should be performed on them, that is, the visible range is defined as key+1 to n-1 and go to step 2 wished Otherwise, the algorithm terminates.
In conclusion, we can say that each sorting algorithm has its own complexity. Depending on the tasks, one of the presented algorithms can be used. But my opinion is that quick sort is the best algorithm. It allows you to select the base element and divides the array into 3 parts: less than, equal to, and greater than the base.
References:
1. Аллаёров, С. П., Ергашев, Б. Б., & Унгаров, Д. Р. (2021). Телекоммуникация тармо;лари параметрларини х,исоблаш усулларини тахлил ;илиш. Science and Education, 2(4), 140-145.
2. Jasur Doniyor, O. G., Saidov, L., Allayorov, S. P., OMBORINI, S. X. I. M. L., & BAHOLASH, Y. B. Y. K. K. MEZONLARI//Scientific progress. 2021. № 1. URL: https://cyb erleninka. ru/articl e/n/ma-lumotl ar-omborini-yarati sh-bo-yicha-kasbiy-kompetentligini-baholash-mezonlari (дата обращения: 02.06. 2022).
3. Qudratov, A., & Allayorov, S. (2024). SUN'IY INTELLEKTNING RIVOJLANISH DAVRI. Евразийский журнал технологий и инноваций, 2(1), 71-75.
4. Allayorov, S. P. (2023). TALIM OLUVCHILARNING TA'LIM OLISHGA BO 'LGAN QIZIQISHLARINI OSHIRISHGA ZAMONAVIY YONDASHISH MUAMMOLARI. Евразийский журнал технологий и инноваций, 1(5), 38-41.
5. Halilovich, I. S. (2022). ZAMONAVIY TA'LIMDA MEDIYA TA'LIMNING AHAMIYATI.
6. Anarbaev, A., Tursunov, O., Kodirov, D., Khudaev, I., Isakhodjayev, K., & Islikov, S. (2021). Pre-sowing activation of seeds by ultraviolet (UV) radiation. In E3S Web of Conferences (Vol. 304, p. 03040). EDP Sciences.
7. Islikov, S., Normurotov, J., Normuminov, B., & Yunusov, A. (2024). METHODOLOGY OF
LEARNING
AND
MIXED
TASKS IN исследований и
USING PROJECT-ORIENTED
EDUCATION. Центральноазиатский журнал междисциплинарных исследований в области управления, 1(2), 138-142.
8. Xalilovich, I. S., & Kisilkova, E. (2023). Unveiling the Transformative Role of Digital Technologies in Education. Best Journal of Innovation in Science, Research and Development, 790-793.
9. Islikov, S., & Ungarov, D. (2023). MASAOFAVIY TA'LIMDA LOYIXAGA YO 'NALTIRILGAN TA'LIM VA ARALASH TOPSHIRIQLARDAN FOYDALANISH METODIKASI. Евразийский журнал технологий и инноваций, 1(6 Part 2), 17-20.
10. Saidov, J., Ishchanova, I., Temirxolova, B., & Nurmuhammedova, Z. (2024). BILIMLAR BAZASINING ASOSIY XUSUSIYATLARI VA ULARGA OID LOYIHALASH. Theoretical aspects in the formation of pedagogical sciences, 3(7), 23-27.
11. Saidov, D., Yo'ldosheva, S., & Sayfullayeva, N. (2024). ALGORITM MURAKKABLIGI TAHLILI. Центральноазиатский журнал междисциплинарных исследований и исследований в области управления, 1(5), 26-30.
12. Saidov, J., Abdujalolova, M., Ochilboyeva, M., & Murodova, G. (2024). MATEMATIKA, IJTIMOIY VA TABIIY FANLAR SOHALARIGA OID ALGORITMLAR. Theoretical aspects in the formation of pedagogical sciences, 3(7), 67-71.
13. Saidov, J. D. Study of the process of database and creation in higher education. Guliston. 2021.
14. Saidov, J., Matmusayeva, M., & To'rayeva, Z. (2024). AXBOROT TIZIMLARI VA ULARNING RIVOJLANISHI OMILLARI. Центральноазиатский журнал междисциплинарных исследований и исследований в области управления, 1(4), 66-69.
15. Abduraximov, D., & Baxodirov, M. (2022). TA'LIMNI AXBOROTLASHTIRISHDA ZAMONAVIY AXBOROT TEXNOLOGIYALARIIMKONIYATLARIDAN FOYDALANISH. Science and innovation, 1(B7), 1529-1534.
16. Toshtemirov, D., Muminov, B., & Saidov, J. (2020). Fundamentals of compilation of electronic tasks for students to test and strengthen their knowledge of database. International Journal of Scientific and Technology Research, 9(4), 3226-3228.
Eshbaevich, T. D. Gulistan State University, 120100, 4th microdistrict, Gulistan city, Syrdarya region, Uzbekistan E-mail: doniyor120373@ gmail. com Abstract. The article describes the creation of modern e-learning resources for educational process, their purpose, content, structure and stages of creation. The article also gives recommendations on how to create e-learning resources, and. Pedagogika, 21.
