• Journal of The Korean Association of Information Education
• /
• v.22 no.6
• /
• pp.671-679
• /
• 2018

Sorting algorithms are the basic building blocks that computer science students need to learn. In recent years, sorting algorithms also have begun to be taught in K-12 classrooms using "the educational sorting game" described in CSUnplugged. However, although the educational sorting game was developed for students aged 8 and up, it is hard for K-12 teachers to play with their students because it is difficult for teachers to understand all of the algorithms and some popular algorithms do not work well in the educational sorting game. In this paper, we discuss what teachers should know, and experimentally analyze the performance of the existing algorithms when applied to the educational sorting game.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.2
• /
• pp.146-155
• /
• 2008

To improve the performance of tiled display system, two parallel tiled display algorithms are proposed by combining the sort-first and the sort-last sorting methods. In the proposed algorithms, the view frustum culling is employed along with the OpenGL display list for the sort-first sorting, and the pre-detection sort-last sparse sorting method is used for sort-last sorting. Through the benchmarking tests, the performances of two proposed algorithms are investigated. Based on the observations, it is suggested how to select an optimal algorithm among the two proposed parallel tiled display algorithms for the given visualization model.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.292-298
• /
• 2022

Coding education and algorithm education are essential in the era of the fourth industrial revolution. Text-oriented algorithm textbooks are perceived as difficult by students who are new to coding and algorithms. There is a need to develop educational content so that students can easily understand the principles of complex algorithms. This paper has implemented basic sorting algorithms as augmented reality contents for students who are new to algorithm education. To make it easier to understand the concept and principles of sorting algorithms, sorting data was expressed as a 3D box and the comparison of values according to the algorithms and the movement of values were produced as augmented reality contents in the form of 3D animations. In order to help with the understanding of sorting algorithms in C language, the change of variable values and the exchange of data were shown as animations according to the execution order of the code and the flow of the loop. Students can conveniently use contents through a smart phone without special equipment by being produced in a marker-based manner. Interest and immersion, as well as understanding of classes of sorting algorithms can be increased through educational augmented reality-based educational contents.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1137-1139
• /
• 1987

We discuss several issues related to the sorting algorithms on hypercube machine. The efficiencies of the algorithms are compared under the simpler assumption and the load balancing problem arising from the various algorithms and the data distribution is also discussed.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.303-310
• /
• 2006

The sorting algorithms have been developed to take advantage of distributed computers. But the speedup of parallel sorting algorithms decrease rapidly with increased number of processors due to parallel processing overhead such as context switching time and inter-processor communication cost. In this paper, we propose a parallel sorting method which provides linear speedup of an optimal serial algorithm for a system with a large number of processors. This algorithm may even provide superlinear speedup for a practical system. The algorithm takes advantage of an interconnection network properties and its protocol.

• Journal of Biosystems Engineering
• /
• v.24 no.4
• /
• pp.325-334
• /
• 1999

The aim of this study was to present a groundwork for development of a sorting system of peeled garlics using machine vision. Images of various garlic samples such as sound, partially defective, discolored, rotten and un-peeled were obtained with a B/W machine vision system. Sorting factors which were based on normalized histogram and statistical analysis(STEPDISC Method) had good separability for various garlic samples. Bayes discriminant function and neural network sorting algorithms were developed with the sample images and were experimented on various garlic samples. It was showed that garlic samples could be classified by sorting algorithm with average sorting accuracies of 88.4% by Bayes discriminant function and 93.2% by neural network.

• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.191-196
• /
• 2021

Computational thinking refers to the process and method of solving everyday problems using computers. When teaching a computational thinking class for computer majors and non-majors at university, the easiest example to deliver the concept of computational thinking is sorting. Sorting is the concept of arranging given data in order. In this work, we have implemented four visualized sorting algorithms that anyone can easily use. In particular, it helps to understand the difference between the algorithms by showing the number of comparisons and exchanges between elements, which are the criteria for evaluating the performance of the sorting algorithm in real time. It was confirmed that the practice of using the sorting visualization app developed in this research contributed to the improvement of students' understanding of computational thinking.

• Journal of The Korean Association For Science Education
• /
• v.7 no.2
• /
• pp.37-43
• /
• 1987

Computer in one of the most tremendous achievements of the modern scientific technique. Not only in government, business, research and education but in our daily life. computers are widely utilized to assist in solving various problems. With increasing frequency, it is recognized that a right understanding of the computer is necessary: naturally, this recognition places a great emphasis on the computer education. In Korea computer is chosen either as an optional subject or as a kind of group activity in many schools. It is the purpose of this study to compare and analyze the internal sorting algorithms which are used frequently in data processing. and to present the results of program analysis. which will make it possible to choose the appropriate sorting algorithm for each data processing. Generally the algorithms are coded in a language appropriate for structured programming. like PASCAL: however, here the algorithms are expressed in BASIC which is widely used with the personal computers so that the students and the teachers may understand them easily.