STUDYING THE TOPIC OF RESEARCHING SELECTION METHODS USING SWOT ANALYSIS
Yuklab olish|Download|Скачать

Keywords

Keywords. Bubble Sort Algorithm, Quick Sort Algorithm, SWOT Analysis, Sorting Algorithms, Data Structures, Algorithm Efficiency, Computational Thinking, Algorithm Analysis.

How to Cite

Nusratova Shakhzodakhon Bakhtiyorovna. “STUDYING THE TOPIC OF RESEARCHING SELECTION METHODS USING SWOT ANALYSIS”. World Scientific Research Journal 52, no. 2 (June 21, 2026): 216–225. Accessed July 15, 2026. https://openresearch-hub.com/index.php/wsrj/article/view/2476.

Abstract

Abstract. This article focuses on the development and implementation of an effective teaching process for the topic “Researching Sorting Methods” within the course “Data Structures and Algorithms” by utilizing the SWOT (Strengths, Weaknesses, Opportunities, and Threats) analysis approach. The study emphasizes the importance of integrating modern pedagogical methods into computer science education to improve students’ understanding of sorting algorithms and their practical applications. Through SWOT analysis, students are encouraged to evaluate various sorting methods, including their advantages, limitations, potential improvements, and challenges encountered in real-world computational tasks. The proposed instructional approach promotes analytical thinking, problem-solving skills, and active participation in the learning process. In addition, it helps learners compare different sorting algorithms based on efficiency, complexity, memory usage, and implementation characteristics. The research demonstrates that the use of SWOT analysis enhances students’ comprehension of algorithmic concepts and supports the development of computational thinking skills. The findings suggest that incorporating SWOT-based activities into the teaching of sorting methods can increase learning effectiveness, strengthen critical evaluation abilities, and contribute to higher educational outcomes in computer science and software engineering programs.

Yuklab olish|Download|Скачать

References

1. Drozdek, A. (2013). Data structures and algorithms in C++ (4th ed.). Cengage Learning.

2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2013). Introduction to algorithms: Design and analysis. MIT Press.

3. Uzakov, Z. (2024, January 18). Otsenka slozhnosti algoritma metoda puzyrka uporyadocheniya elementov odnomernogo massiva [Assessment of the complexity of the bubble sort algorithm for arranging elements of a one-dimensional array]. In Proceedings of the scientific-methodical conference dedicated to the memory of Qobiljon Mustafoyev.

4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2013). Algorithms: Design and analysis (3rd ed.). Williams Publishing.

5. Wirth, N. (2010). Algorithms and data structures. DMK Press.

6. Dasgupta, S., Papadimitriou, C. H., & Vazirani, U. V. (2014). Algorithms. Moscow Center for Continuous Mathematical Education.