scholarly journals Implementation Of Bubble Sort Algorithm On 2 Fruit Models Of Data Selection Using The Java Program Language

Petir ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 159-169
Author(s):  
Endang Sunandar
Keyword(s):  
Data Sequence ◽  
Radix Sort ◽  
Java Programming ◽  
Advantages And Disadvantages ◽  
Program Language ◽  
Java Program ◽  
Ordered Data ◽  
Sort Algorithm ◽  
Data Sorting ◽  
Quick Sort

There are various kinds of data sorting methods that we know of which are the Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Shell Sort, Heap Sort, and Radix Sort methods. All of these methods have advantages and disadvantages of each, whose use is determined based on needs. Each method has a different algorithm, where different algorithms affect the execution time. One interesting algorithm to be implemented on 2 variant models of data sorting is the Bubble Sort algorithm, the reason is that this algorithm has a fairly long and detailed process flow to produce an ordered data sequence from a previously unordered data sequence. Two (2) data sorting variant models that will be implemented using the Bubble Sort algorithm are: Ascending data sorting variants moving from left to right, and Descending data sorting variants moving from left to right. And the device used in implementing the Bubble Sort algorithm is the Java programming language.

scholarly journals Implementasi Algoritma Bubble Sort Terhadap 2 Buah Model Varian Pengurutan Data Menggunakan Bahasa Program Java

Petir ◽  
2020 ◽  
Vol 13 (2) ◽  
pp. 255-265
Author(s):  
Endang Sunandar ◽  
Indrianto Indrianto
Keyword(s):  
Sorting Algorithm ◽  
Sequential Data ◽  
Programming Technique ◽  
Advantages And Disadvantages ◽  
Program Language ◽  
Java Program ◽  
The Right ◽  
Sort Algorithm ◽  
Data Sorting ◽  
Made In

In the field of computer science the efforts made in solving a problem are to use systematic, logical, and strategic flow and steps. These steps are known as algorithms. So many algorithms exist for solving a particular problem. In connection with this paper the algorithm discussed is about the data sorting algorithm, among the few known are: Merge, Selection, Insertion, Bubble, Quick, Heap, Shell. All of these algorithms have advantages and disadvantages of each. One interesting algorithm to be implemented on 2 models of data sorting variants is the Bubble Sort algorithm, the reason is that this algorithm has a fairly long and detailed process flow to produce sequential data sequences from previously unsordered data sequences. And the purpose of implementing them using the language of the program is to be able to provide a translation picture of a complicated and long Bubble Sort algorithm that becomes easier and concise to solve using the program language, which in this case uses the Java program language. For ascending sequencing moving from left to right the method is by shifting the larger values ​​to the right position in sequence, so that finally the smaller values ​​are on the left, whereas for descending sorting moving from left to right the method is by shifting the smaller values ​​to the right position in sequence, so that finally the larger values ​​are on the left. And the programming technique differs only in relation operators that are used against the data being compared.

Analisis Kinerja Algoritma Quick Double Merge Sort Paralel Menggunakan openMP

2020 ◽  
Vol 11 (2) ◽  
pp. 95-102
Author(s):  
I Nyoman Aditya Yudiswara ◽  
Abba Suganda
Keyword(s):  
Parallel Algorithms ◽  
The Other ◽  
Sorting Algorithm ◽  
Data Parallelism ◽  
Parallel Sorting ◽  
Sequential Algorithms ◽  
Sorting Algorithms ◽  
Merge Sort ◽  
Sort Algorithm ◽  
Quick Sort

Processor technology currently tends to increase the number of cores more than increasing the clock speed. This development is very useful and becomes an opportunity to improve the performance of sequential algorithms that are only done by one core. This paper discusses the sorting algorithm that is executed in parallel by several logical CPUs or cores using the openMP library. This algorithm is named QDM Sort which is a combination of sequential quick sort algorithm and double merge algorithm. This study uses a data parallelism approach to design parallel algorithms from sequential algorithms. The data used in this study are the data that have not been sorted and also the data that has been sorted is integer type which is stored in advance in a file. The parameter measured to determine the performance of the QDM Sort algorithm is speedup. In a condition where a large amount of data is above 4096 and the number of threads in QDM Sort is the same as the number of logical CPUs, the QDM Sort algorithm has a better speedup compared to the other parallel sorting algorithms discussed in this study. For small amounts of data it is still better to use sequential sorting algorithm.

The Development of Object-Oriented SECS Communication Module Using Java, UML and Design Patterns

2008 ◽  
Vol 2 (2) ◽  
pp. 96-104
Author(s):  
Yen-Hui Li ◽  
◽  
Meng-Chang Chan ◽  
An-Chen Lee ◽  
◽  
...  
Keyword(s):  
Design Patterns ◽  
Unified Modeling Language ◽  
Object Oriented ◽  
Unified Modeling ◽  
Reusable Software ◽  
Program Language ◽  
Java Program ◽  
Communication Module ◽  
Analysis Design ◽  
Communication Equipment

This paper develops an SECS Communication Module, which conforms to SEMI standard, using the Object-oriented Analysis/Design (OOA/D) method. The two main features of SECS Communication Module are Unified Modeling Language (UML) and Design Patterns for developing flexible and reusable software architecture and JAVA program language for implementing SECS Communication Module. The developed SECS communication module can not only be integrated into cluster tool control but can also run stand-alone in a communication equipment.

scholarly journals Java GUI application for comparing the levels of biometric security: Fingerprint vs. Iris

2021 ◽  
Vol 69 (3) ◽  
pp. 676-686
Author(s):  
Komlen Lalović ◽  
Mitko Bogdanoski
Keyword(s):  
Comparative Analysis ◽  
Iris Recognition ◽  
Scientific Data ◽  
Body Parts ◽  
Main Method ◽  
Software Application ◽  
Java Programming ◽  
Advantages And Disadvantages ◽  
Iris Biometrics ◽  
The Difference

Introduction/purpose: The main purpose of this paper is to present a novel Java GUI - based software application for a comparative analysis of fingerprint and iris biometrics. Methods: The first part of this work is realized in Java Programming language. in the GUI framework named swing while the rest of the paper shows in detail the advantages and disadvantages of both systems and gives scientific data on when fingerprint and iris recognition can be used to enable top level security. The main method here is a well known comparative analysis. Results: The results were obtained for both fingerprint and iris biometrics, showing the difference between the two. Conclusion: Different types of biometrics, based on body parts formed at different age, are given as well as the comparison of their security levels.

Study of Java Language Teaching Model in Private Colleges

2011 ◽  
Vol 268-270 ◽  
pp. 1046-1049
Author(s):  
Zhen Zhong Zhan ◽  
Zhen Dong Mu
Keyword(s):  
Software Development ◽  
Private Colleges ◽  
Language Teaching ◽  
Teaching Quality ◽  
Private College ◽  
Teaching Model ◽  
Java Programming ◽  
Java Language ◽  
Java Program ◽  
Development Capability

The purpose of set java language in private college is to train students to use the Java program for software development capability. In this paper, private colleges teaching Java programming status and problems are analyzed and discussed, and some improvements in order to achieve the effect of improving teaching quality.

scholarly journals Design and Analysis of Optimized Stooge Sort Algorithm

2019 ◽  
Vol 8 (12) ◽  
pp. 1669-1673
Keyword(s):  
Time Complexity ◽  
Large Time ◽  
Sorting Algorithm ◽  
Data Element ◽  
Running Time ◽  
Sorting Algorithms ◽  
Sorting Technique ◽  
Sort Algorithm ◽  
The Given ◽  
Data Sorting

Data sorting hasmany advantages and applications in software and web development. Search engines use sorting techniques to sorttheresult before itispresented totheuser.Thewordsinadictionary are insorted ordersothatthewords canbe found easily.There aremanysorting algorithms that areused in many domains to perform some operation and obtain the desired output. But there are some sorting algorithms that take large time in sorting the data. This huge time can be vulnerable to the operation. Every sorting algorithm has the different sorting technique to sort the given data, Stooge sort is asorting algorithm which sorts the data recursively. Stooge sort takes comparatively more time as compared tomany othersorting algorithms.Stooge sortworks recursively to sort the data element but the Optimized Stooge sort does not use recursive process. In this paper, we propose Optimized Stooge sort to reduce the time complexity of the Stooge sort. The running time of Optimized Stooge sort is very much reduced as compared to theStooge sort algorithm. The existing researchfocuses onreducing therunning time of Stooge sort. Our results show that the Optimized Stooge sort is faster than the Stooge sort algorithm.

Sign in / Sign up

Export Citation Format

Share Document