Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2025
Teaching the Bubble Sort Algorithm Using CS Unplugged Activities at the K-12 Level
ACM Transactions on Computing Education (TOCE), Volume 25, Issue 1Article No.: 3, Pages 1–22https://doi.org/10.1145/3706120Computer Science (CS) Unplugged activities are designed to engage students with CS concepts. It is an active learning approach combining physical interaction with visual representation. This research article investigates the impact of CS Unplugged on ...
- research-articleNovember 2019
Influence of kernel clustering on an RBFN
CAAI Transactions on Intelligence Technology (CIT2), Volume 4, Issue 4Pages 255–260https://doi.org/10.1049/trit.2019.0036Classical radial basis function network (RBFN) is widely used to process the non‐linear separable data sets with the introduction of activation functions. However, the setting of parameters for activation functions is random and the distribution of ...
- abstractFebruary 2019
Benefits of Physical Interaction with Array Elements and Code Consolidation on Student Comprehension of Sorting Algorithms
SIGCSE '19: Proceedings of the 50th ACM Technical Symposium on Computer Science EducationPages 1263–1264https://doi.org/10.1145/3287324.3293797This study was a qualitative analysis of introductory-level computer science students' comprehension of sorting algorithms. We asked six students to read and summarize the code of a sorting algorithm. Next, we asked them to trace through the code, first ...
- ArticleJuly 2010
Analysis on Bubble Sort Algorithm Optimization
IFITA '10: Proceedings of the 2010 International Forum on Information Technology and Applications - Volume 01Pages 208–211https://doi.org/10.1109/IFITA.2010.9Based on the analysis of the traditional bubble sort algorithm, this paper proposes two bidirectional bubble sort algorithm design ideas. After giving C language description of the three algorithms, the paper tests the new algorithms, analyzes ...
- ArticleMay 2009
Variable-length code based on an order complexity
In this paper, we introduce new codeword sets based on order complexity (OC) which measures uncertainty of the order having each permutation string. The proposed codeword sets are generated by two procedures: Indexing and B-transform. Indexing is that a ...
- ArticleJune 2006
Surprise snippets
ITICSE '06: Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science educationPage 351https://doi.org/10.1145/1140124.1140260This presentation describes various programming surprises created to motivate students to experimentation and discovery by appealing to their curiosity.
Also Published in:
ACM SIGCSE Bulletin: Volume 38 Issue 3 - ArticleJanuary 2003
Bubble sort: an archaeological algorithmic analysis
SIGCSE '03: Proceedings of the 34th SIGCSE technical symposium on Computer science educationPages 1–5https://doi.org/10.1145/611892.611918Text books, including books for general audiences, invariably mention bubble sort in discussions of elementary sorting algorithms. We trace the history of bubble sort, its popularity, and its endurance in the face of pedagogical assertions that code and ...
Also Published in:
ACM SIGCSE Bulletin: Volume 35 Issue 1 - research-articleDecember 1983
The VLSI Complexity of Sorting
IEEE Transactions on Computers (ITCO), Volume 32, Issue 12Pages 1171–1184https://doi.org/10.1109/TC.1983.1676178The area-time complexity of sorting is analyzed under an updated model of VLSI computation. The new model makes a distinction between "processing" circuits and "memory" circuits; the latter are less important since they are denser and consume less ...