Komparasi Algoritma Quicksort dan Bucket Sort pada Pengurutan Data Integer

2015 ◽  
Vol 7 (1) ◽  
Author(s):  
Audy Audy
Keyword(s):  
Data Type ◽  
Minimum Amount ◽  
Time And Space ◽  
Worst Case ◽  
Sorting Algorithms ◽  
Program Complexity ◽  
Data Sorting ◽  
Case Condition

Data sorting is a technique that widely used as a part of a bigger process. Therefore, data sorting should not be the problem of program complexity. This paper gives the reader a comparison between two sorting algorithms, which are comparison based and non-comparison based, in time and space performance. The data type that used in this paper is an integer data type. Testing is carried out by using two types of data’s condition, which are the worst-case condition in each algorithm, and two amounts of data, which represent the maximum and minimum amount data.

scholarly journals Engineering Augmented Suffix Sorting Algorithms

2018 ◽  
Author(s):  
Felipe A. Louza ◽  
Guilherme P. Telles ◽  
Simon Gog
Keyword(s):  
Computer Science ◽  
Full Text ◽  
Suffix Array ◽  
Optimal Time ◽  
Time And Space ◽  
Sorting Algorithms ◽  
Constant Size ◽  
Common Prefix ◽  
Efficient Processing ◽  
Burrows Wheeler Transform

Strings are prevalent in Computer Science and algorithms for their efficient processing are fundamental in various applications. The results introduced in this work contribute with theoretical improvements and practical advances in building full-text indexes. Our first contribution is an in-place algorithm that computes the Burrows-Wheeler transform and the longest common prefix (LCP) array. Our second contribution is the construction of the suffix array augmented with the LCP array in optimal time and space for strings from constant size alphabets. Our third contribution is a set of algorithms to construct full-text indexes for string collections in optimal theoretical bounds. This work is an extended abstract of the Ph.D. thesis of the first author.

Hydrogen embrittlement characteristics of two tempered martensitic steel alloys for high-strength bolting

2016 ◽  
Vol 231 (17) ◽  
pp. 3214-3227 ◽  
Author(s):  
SV Brahimi ◽  
KR Sriraman ◽  
S Yue
Keyword(s):  
Hydrogen Embrittlement ◽  
High Strength ◽  
Order Effect ◽  
Worst Case ◽  
Internal Hydrogen ◽  
Industry Practice ◽  
Steel Grades ◽  
Quenched And Tempered Steel ◽  
Case Condition ◽  
Aisi 4340

Hydrogen embrittlement threshold curves were derived for two quenched and tempered steel grades, AISI 4135 and AISI 4340, at varying hardness ranging from 33 to 54 HRC. For each material, hydrogen was introduced (i) by zinc electroplating as a worst case condition for internal hydrogen embrittlement and (ii) by imposing cathodic potential of −1.2 V as a worst case condition for environmental hydrogen embrittlement. Overall, AISI 4135 exhibited lower thresholds than AISI 4340, making it the more susceptible of the two alloys. The findings demonstrate although hardness and/or strength have a first-order effect on hydrogen embrittlement susceptibility, difference in chemistry leading to differences microstructural characteristics must also be considered. Below hardness of 39 HRC, both alloys were not susceptible to internal hydrogen embrittlement, a finding that is consistent with common industry practice and fastener electroplating standards that do not mandate baking of electroplated fasteners with specified hardness below 39 HRC.

Big Data Integration and Processing Model

2021 ◽  
Vol 20 ◽  
pp. 82-87
Author(s):  
Stella Vetova
Keyword(s):  
Big Data ◽  
Data Integration ◽  
Data File ◽  
Data Type ◽  
File Format ◽  
Model Design ◽  
Sorting Process ◽  
Integration Data ◽  
Data Sorting

The presented paper deals with data integration and sorting of Covid-19 data. The data file contains fifteen data fiels and for the design of integration and sorting model each of them is configured in data type, format and field length. For the data integration and sorting model design Talend Open Studio is used. The model concerns the performance of four main tasks: data integration, data sorting, result display, and output in .xls file format. For the sorting process two rules are assigned in accordance with the medical and biomedical requirements, namely to sort report date descending order and the Country Name field in alphabetical one

scholarly journals A search game model of the scatter hoarder's problem

2011 ◽  
Vol 9 (70) ◽  
pp. 869-879 ◽  
Author(s):  
Steve Alpern ◽  
Robbert Fokkink ◽  
Thomas Lidbetter ◽  
Nicola S. Clayton
Keyword(s):  
Survival Probability ◽  
Minimum Amount ◽  
Game Model ◽  
Worst Case ◽  
Search Games ◽  
Search Game ◽  
Caching Strategy ◽  
Catastrophic Loss ◽  
Observed Behaviour ◽  
Optim Theory

Scatter hoarders are animals (e.g. squirrels) who cache food (nuts) over a number of sites for later collection. A certain minimum amount of food must be recovered, possibly after pilfering by another animal, in order to survive the winter. An optimal caching strategy is one that maximizes the survival probability, given worst case behaviour of the pilferer. We modify certain ‘accumulation games’ studied by Kikuta & Ruckle (2000 J. Optim. Theory Appl. ) and Kikuta & Ruckle (2001 Naval Res. Logist. ), which modelled the problem of optimal diversification of resources against catastrophic loss, to include the depth at which the food is hidden at each caching site. Optimal caching strategies can then be determined as equilibria in a new ‘caching game’. We show how the distribution of food over sites and the site-depths of the optimal caching varies with the animal's survival requirements and the amount of pilfering. We show that in some cases, ‘decoy nuts’ are required to be placed above other nuts that are buried further down at the same site. Methods from the field of search games are used. Some empirically observed behaviour can be shown to be optimal in our model.

scholarly journals Improving the Efficiency of Deduplication Process by Dedicated Hash Table for each Digital Data Type in Cloud Storage System

Webology ◽  
2021 ◽  
Vol 18 (Special Issue 01) ◽  
pp. 288-301
Author(s):  
G. Sujatha ◽  
Dr. Jeberson Retna Raj
Keyword(s):  
Data Storage ◽  
Cloud Storage ◽  
Storage System ◽  
Hash Table ◽  
Cloud Services ◽  
Data Type ◽  
Digital Data ◽  
Storage Space ◽  
Data Deduplication ◽  
Worst Case

Data storage is one of the significant cloud services available to the cloud users. Since the magnitude of information outsourced grows extremely high, there is a need of implementing data deduplication technique in the cloud storage space for efficient utilization. The cloud storage space supports all kind of digital data like text, audio, video and image. In the hash-based deduplication system, cryptographic hash value should be calculated for all data irrespective of its type and stored in the memory for future reference. Using these hash value only, duplicate copies can be identified. The problem in this existing scenario is size of the hash table. To find a duplicate copy, all the hash values should be checked in the worst case irrespective of its data type. At the same time, all kind of digital data does not suit with same structure of hash table. In this study we proposed an approach to have multiple hash tables for different digital data. By having dedicated hash table for each digital data type will improve the searching time of duplicate data.

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