Quick Sort Method Research Articles

MEAN-OF-2-4 QUICKSORT

By combining the Median-of-three and Regrouping-3 quicksort methods, the Joint quicksort is proposed, largely free from the shortcomings of the first two. For example, the time complexity of Joint quicksort, in case of lists of n equal elements, is O(n). Analysis of the dependence of Quicksort time complexity on the ratio of the derived sublist sizes shows a relatively slow increase in sorting time as the ratio in question decreases from 0.5 to 0.1. The proposed category of Mean-of-K (MeK) sorting algorithms provides for the determination of pivot elements as the mean of K elements. It is shown that, in terms of sorting time, at K ∈ [1, 4] and size r of the list/sublist of elements to be sorted, it is convenient to use (roughly): Insertion sort at r ≤ 9, Me2 quicksort at 10 ≤ r ≤ 21, Me3 quicksort at 22 ≤ r ≤ 46, and Me4 quicksort at r > 46, yielding the Mean-of-2-4 quicksort method. It was found that the determination of pivot elements in the Median-of-three method requires more calculations than in the Mean-of-3 method; respectively, using Mean-of-3 method could also reduce sorting time. Of course, Mean-of-2-4 method could reduce this duration even further.

An efficient video summarization for surveillance system using normalized k-means and quick sort method

There has been a vast augmentation in quantity of Video Content (VC) generated amid the last some years. The Video Summarization (VS) approach is introduced for managing the VC. Prevailing VS techniques have endeavored to render the VS but the systems have Execution Time (ET) as well as condensing the video's content in domain specific manner. To triumph over such disadvantages, this paper proposed efficient VS for surveillance system using normalized k-means along with quick sort method. The proposed technique comprises eight stages, like split video into frames, pre-sampling, provide ID number, feature extraction, Feature Selection (FS), clustering, extract frames, video summary. Initially, the video frames are pre-sampled utilizing the proposed Three Step Cross Searching Algorithm (TSCS) technique. Then, give the ID number for every frame. Next, the features are extracted as of the frames. Then, the necessary features are selected using Entropy based Spider Monkey Algorithms (ESMA). In next stage, the features are grouped using Normalized K-Means (N-Kmeans) algorithm for identifying best candidate frames. Then select the minimum distance value based cluster set is the Key Frame (KF) selection. At last, the video is orderly summarized using quick sort method. Finally, in experimental evaluation the proposed work is compared with the prevailing methods. The proposed VS gave better outcome than the existing approaches.

COMPARISON OF QUICKSORT AND MERGESORT METHOD FOR USER INTERFACE AND USER EXPERIENCE ASSESSMENT IN ADISUTJIPTO COLLEGE OF TECHNOLOGY

This study is intended to assess the user interface and user experience on the Adisutjipto College of Technology website using the mergesort method and compared with the quicksort method in finding the highest value of several variables or elements that are categorized as good or good in order to improve the quality of the Adisutjipto College of Technology website. The results of the study show that the quicksort method is faster in the process of calculating questionnaire data than the merge method with an average time record of 0.476667 seconds for the quicksort method and 0.576667 seconds for the mergesort method. The results of the comparison of the two methods on the questionnaire website to assess the accuracy in terms of user interface and user experience on the Adisutjipto College of Technology website, that the mergesort method is more accurate than the quicksort method, the Usability category scores the highest, while the Expressive aesthentics category has the lowest value

Identification of the Use and Utilization of Information Technology for the Residents of Tegalrejo Berbah Sleman Yogyakarta

The usage Information Technology of smartphones is increasingly prevalent in various parts of the world, especially the Indonesian people themselves are competing to buy the latest type of smartphone because of user dissatisfaction with the smartphone features offered. This can be seen through users of various ages, ranging from children, teenagers to adults. Likewise for the residents of the Tegalrejo area, the use of information and communication technology has become popular in the community. The purpose of this study was to identify the results of data processing using and utilizing information technology via smartphone by the people of Berbah Sleman Tegalrejo using the quicksort method. Identification results to find out the use and utilization of information technology through smartphones with features that have been used effectively and efficiently by the residents of Tegalrejo Berbah Sleman so as to make a digital literacy community.

Augmented Reality as A Display Information Using Quick Sort

Information media of technology nowadays becomes a very easy means to convey information, and one of the recent technologies that still develop is augmented reality, which is used as information media. Augmented reality can integrate an image target and can be implemented easily. This technology utilizes an object tracing and uses detail feature from every camera object, after that it can be applied to all smartphones. By taking advantage of this technology, the augmented reality, and using logo marker and animation video, Faculty of Information and Communication Technology Semarang University can share information of its activities and can attract many people's attention to know further about activities held by this faculty. This research focuses on the augmented reality which will show the activities ranking, the activities held by the Faculty of Information and Communication Technology. The activities are shown by animation video using quick sort method to display them based on the most number of activities held by each study program. The result of this research finds out that study program of communication technology holding the first ranking. This study program holds the most often activities so the number of activities is the highest. The application can be displayed virtually using a smartphone and developed using Unity 3D and Vuforia.

IMPLEMENTASI LOAD BALANCING BERBASIS CLOUD COMPUTING UNTUK MENDUKUNG INFRASTRUCTURE AS A SERVICE MENGGUNAKAN METODE QUICK SORT

Implementation of load balancing in cloud computing applications using quick sort method is a study to determine the access speed of each server. Design a cloud computing application using 4 laptops as application users and 3 laptops or PCs as servers in data storage. In sending data performed by the user application, the data will be distributed to the server that has been selected by the system with a quick sort method that sort the rest of the server capacity and then choose the server with the largest capacity. The stored data is placed in the htdocs file on the server. Based on the tests performed, cloud computing applications can run on at least 2 laptops using the windows version. Testing the server is also done by directly using the command prompt. During testing each server receives ping from the application to determine server performance in using load balancing. Testing without load balancing that sends data 50 times of 10 Mb to one server yields speed 15 ms, with 2 server divided by two in its data delivery that is as much as 25 times 10 Mb then speed 12 ms.

基于快速排序法的MMC电容电压均衡控制策略

随着基于模块化多电平换流器的柔性直流输电工程容量和直流侧电压等级的提高，对子模块电容平衡控制提出了更高的要求。为降低众多子模块均压排序的计算量及MMC开关损耗，提出一种基于分治思想和快速排序算法的改进子模块电容电压均衡控制策略。根据每个控制周期的投切控制指令和桥臂充放电状态，将待投切子模块电容电压值进行两轮分组，然后根据具体投切数量在最小范围内选取与额定电容电压差值较大的子模块进行投切操作，从而避免对所有子模块进行重复排序。最后，通过在PSCAD/EMTDC中搭建MMC模型对本文方法进行了验证，结果表明该策略可以有效减小排序计算量并降低MMC开关损耗。 With the improvement of the engineering capacity and the DC voltage level of FACTS based on modular multilevel converter (MMC), it is putting forward higher requirement for capacitor bal-ance control issue of MMC sub-modules (SMs). In order to reduce the computational complexity of voltage balancing sorting of SMs and switching dissipation of MMC, a new voltage balancing control improved algorithm based on Quick Sort method and divided conquer was presented in this paper: dividing into groups twice according to the switching control instruction as well as charging and discharging active status of bridge arms in each control cycle; then choosing the SMs which have large difference with rated voltage within the minimum range on the basis of specific switching number; avoiding the prophecy of collating all SMs repeatedly. A MMC model has been set up on the PSCAD. Finally, the effectiveness of the design control method was verified. The results show that this voltage balancing method can be realized effectively under low switching dissipation and low ranking calculation.

Per-Pixel Coded Exposure for High-Speed and High-Resolution Imaging Using a Digital Micromirror Device Camera.

High-speed photography is an important tool for studying rapid physical phenomena. However, low-frame-rate CCD (charge coupled device) or CMOS (complementary metal oxide semiconductor) camera cannot effectively capture the rapid phenomena with high-speed and high-resolution. In this paper, we incorporate the hardware restrictions of existing image sensors, design the sampling functions, and implement a hardware prototype with a digital micromirror device (DMD) camera in which spatial and temporal information can be flexibly modulated. Combined with the optical model of DMD camera, we theoretically analyze the per-pixel coded exposure and propose a three-element median quicksort method to increase the temporal resolution of the imaging system. Theoretically, this approach can rapidly increase the temporal resolution several, or even hundreds, of times without increasing bandwidth requirements of the camera. We demonstrate the effectiveness of our method via extensive examples and achieve 100 fps (frames per second) gain in temporal resolution by using a 25 fps camera.

Analysis of methods for number array sorting

This article considers the methods of sorting, i.e. placing the array of numbers, which are used in computer techniques today, according to the rule. Sorting is one of the most common principles of programming systems, while their application for various applied problems requires choosing an optimal sorting algorithm from a set of existing ones. The objective of the article is to analyze temporal characteristics of the selection process aimed at choosing the algorithm, which is the most suitable for a certain goal realization.Existing methods of sorting can be grouped into: sorting by insertion, sorting by selection, sorting by exchange.Existing methods are analyzed in terms of quantity indexes of exchanges, integrations and comparisons that define each algorithm at most. As a result, the total operating speed of each method was estimated; the advantages and disadvantages of each method were singled out.The results of analysis of well known sorting methods allow choosing the best method for software and hardware implementation from this point of view. The principal possibility of new solutions in the field of hardware implementation was shown in order to increase the level of parallelism and accelerate the sorting process, whereby the sorting method by exchange should be prerogative.After checking the known sorting methods for operating speed with the use of the constant volume array, the operation time of sorting programs was defined on the basis of different sorting methods. Yet, the sorting method of Shell and quick sort method have shown best results.

A Quick Algorithm for Attribute Reduction Based on Divide and Conquer Method

Knowledge reduction is one of the most important contributions of rough set theory. High efficient algorithm is necessary for attribute reduction. In this paper, combining given attribute order and quick sort method, a heuristic algorithm for attribute reduction is developed. In this method, the objects in universe are divided into many small parts on the attributes by divide and conquer method, and different granules in different granular levels are obtained. The small ones can be processed quickly, so a fast heuristic algorithm for attribute reduction is proposed. Simulation experiment results illustrate the high efficiency of the improved knowledge reduction algorithm.

Droplet collision and coalescence model

A new droplet collision and coalescence model was presented, a quick-sort method for locating collision partners was also devised and based on theoretical and experimental results, further advancement was made to the droplet collision outcome. The advantages of the two implementations of smoothed particle hydrodynamics (SPH) method were used to limit the collision of droplets to a given number of nearest droplets and define the probability of coalescence, numerical simulations were carried out for model validation. Results show that the model presented is mesh-independent and less time consuming, it can not only maintains the system momentum conservation perfectly, but not susceptible to initial droplet size distribution as well.

Efficient C4.5 [classification algorithm

We present an analytic evaluation of the runtime behavior of the C4.5 algorithm which highlights some efficiency improvements. Based on the analytic evaluation, we have implemented a more efficient version of the algorithm, called EC4.5. It improves on C4.5 by adopting the best among three strategies for computing the information gain of continuous attributes. All the strategies adopt a binary search of the threshold in the whole training set starting from the local threshold computed at a node. The first strategy computes the local threshold using the algorithm of C4.5, which, in particular, sorts cases by means of the quicksort method. The second strategy also uses the algorithm of C4.5, but adopts a counting sort method. The third strategy calculates the local threshold using a main-memory version of the RainForest algorithm, which does not need sorting. Our implementation computes the same decision trees as C4.5 with a performance gain of up to five times.

Merging by Decomposition Revisited

This paper presents some modifications of stable merging by decomposition (referred to as DM here). The changes made reduce the time requirements considerably. Furthermore, a O(1)-space version of merging is described. The modifications of DM resemble improvements to the original Quicksort method for sorting, since both the algorithms are of the same generic scheme.

Analysis of the performance of the parallel quicksort method

In this paper a theoretical analysis of the performance of a parallel form of the Quicksort algorithm is presented and shown to be in qualitative agreement with experiments carried out on the Loughborough University NEPTUNE parallel system.