Filters








5,276,160 Hits in 4.7 sec

Sorting Out Sorts

Jonathan B. Berk
2000 Journal of Finance  
In this paper we analyze the theoretical implications of sorting data into groups and then running asset pricing tests within each group.  ...  By simply picking enough groups to sort into, the true asset pricing model can be shown to have no explanatory power within each group.  ...  Except for the 10-fractile partition, the Sorting Out Sorts theoretical value of one.  ... 
doi:10.1111/0022-1082.00210 fatcat:xxsxejnamjdd5byr7q4jsm23g4

Sorting Out Sorts

Jonathan B. Berk
1997 Social Science Research Network  
In this paper we analyze the theoretical implications of sorting data into groups and then running asset pricing tests within each group.  ...  By simply picking enough groups to sort into, the true asset pricing model can be shown to have no explanatory power within each group.  ...  Except for the 10-fractile partition, the Sorting Out Sorts theoretical value of one.  ... 
doi:10.2139/ssrn.36156 fatcat:3cso3tnowzei3bygh4c4jlkeei

Sorting using a combination of Bubble Sort, Selection Sort & Counting Sort

Sahil Kumar, Prerna Singla
2019 International Journal of Mathematical Sciences and Computing  
This paper presents an enhanced sorting algorithm which comprises of a combination of Bubble Sort, Selection Sort, and Counting Sort.  ...  Although sorting is a very old computer science problem, it still attracts a great deal of research.  ...  Many algorithms are present that help us to sort the unordered data like Bubble sort, Selection sort, Quick sort, Merge sort and the list is endless.  ... 
doi:10.5815/ijmsc.2019.02.03 fatcat:tj2llez7pjb7dbhnklsrzcupji

UCSD SORT Test (U-SORT)

Denisse Tiznado, Brent T. Mausbach, Veronica Cardenas, Dilip V. Jeste, Thomas L. Patterson
2010 Journal of Nervous and Mental Disease  
Participants' organizational skills were measured using our newly developed UCSD Sorting Test (U-SORT); a performance-based test of organizational ability in which subjects sort objects (e.g., battery,  ...  correlations were found between U-SORT scores and theoretically dissimilar constructs (e.g., health symptoms, social support, gender; mean r = |.06|).  ...  U-SORT and medical physical symptoms (z = 4.34, p < .001); and the U-SORT and social support (z = 3.05, p = . 002).  ... 
doi:10.1097/nmd.0b013e3181fe75b6 pmid:21135646 pmcid:PMC3160787 fatcat:efnztajykbg55baobu4bh5j2hi

Protein secretion: Sorting sweet sorting

Sreenivasan Ponnambalam, George Banting
1996 Current Biology  
But this does not explain why proteins and hormones are selectively sorted into different types of vesicle.  ...  The Golgi apparatus lies at the heart of the secretory pathway, and is a crucial sorting station for proteins destined for the cell surface and other intracellular compartments [10] .  ... 
doi:10.1016/s0960-9822(02)70669-6 pmid:8805362 fatcat:ucj5tqaugjb3jkyba3uubilpza

Sorting [chapter]

Tony Royce
1992 Structured COBOL  
Note that the work-file records should be set out in the same way as the file which has to be sorted and the Sort key is specified as one of the fields in the work-file. e.g.  ...  The details of the records for the unsorted file and the new sorted file do not have to be specified for the sort routine as they are assumed to be the same as those of the work-file -you can of course  ... 
doi:10.1007/978-1-349-12240-0_70 fatcat:qoei7cufinf2rav37lwnb4woki

Sorting [chapter]

Tony Royce
1991 COBOL  
Note that the work-file records should be set out in the same way as the file which has to be sorted and the Sort key is specified as one of the fields in the work-file. e.g.  ...  Note that you should not open files for the sort routine as it opens files itself automatically and closes them when it has finished. USING UNSORTED-ST AFF-FILE GIVING SORTED-ST AFF-FILE.  ... 
doi:10.1007/978-1-349-12238-7_66 fatcat:ruzaluwhijgj3e6244332gnzza

Sorted

WOUTER SWIERSTRA
2011 Journal of functional programming  
. = read (inj i) > > = λ c → case c of Red → sort (Next i) (Next j) pDiff White → swap (inj i) (Next j) > > sort (inj i) (inj j) pInj The final definition of the sort function, using the SortT predicate  ...  w = if r ≡ w then return unit else read r > > = λ c → case c of Red → sort (r + 1) w White → swap r w > > sort r (w − 1) Fig. 1.  ... 
doi:10.1017/s0956796811000207 fatcat:jbyyagmivfd4lexwdx5dini6m4

Sorting

W. A. Martin
1971 ACM Computing Surveys  
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years.  ...  The last pass of a Shell sort is a bubble sort. A Shell sort is shown in Figure 2 .  ...  The Bubble Sort One of the simplest interchange sorts is the bubble sort [A18, A19, A27, A30].  ... 
doi:10.1145/356593.356594 fatcat:kme5yo34gnhmjmu4w7p3xfxica

MM Sort algorithms

Mihir Narshana
2016 International Journal Of Engineering And Computer Science  
The Algorithm to solve problem of sorting is on reference of BUBBLE sort technique. The procedure to sort the element is extremely different.  ...  Sorting is used for arranging a data either in ascending order or descending order. I have discussed here in these paper about new Algorithm to solve the problem of sorting.  ...  Bubble sort:- The bubble sort is the oldest and simplest sorting method in use. Unfortunately, it's also the slowest.  ... 
doi:10.18535/ijecs/v5i9.30 fatcat:h4r6qqcg25e7hika447axyjq4q

Heap Sorting Based on Array Sorting

Haiming Li, Ping Chen, Yong Wang
2017 Journal of Computer and Communications  
A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application.  ...  But it is not studied in this paper. 3) Heap sort is a tree selection sort algorithm.  ...  In the larger array sequence, the heap sorting algorithm is applied directly. Its time complexity is as same as quick sort and merging sort.  ... 
doi:10.4236/jcc.2017.512006 fatcat:7cpqc5iyxbapzdypoh7pi2x4cy

Matrix Sort - A Parallelizable Sorting Algorithm

S. Kavitha, Vijay V., Saketh A.
2016 International Journal of Computer Applications  
In this paper, a new sorting algorithm called Matrix sort is introduced. This algorithm aims to sort the elements of a matrix without disturbing the matrix structure.  ...  Sorting algorithms are the class of algorithms that result in the ordered arrangement of a list of given elements.  ...  sorted.  ... 
doi:10.5120/ijca2016910341 fatcat:bin4yjmxyzaivm2zbeecvvkf4a

MQ Sort an Innovative Algorithm using Quick Sort and Merge Sort

Renu Renu, Manisha Manisha
2015 International Journal of Computer Applications  
There are several simple and complex sorting algorithms that are being used in practical life as well as in computation such as Quick sort, Bubble sort, Merge sort, Bucket sort, Heap sort, Radix sort etc  ...  This paper introduces MQ sort which combines the advantages of quick sort and Merge sort. The comparative analysis of performance and complexity of MQ sort is done against Quick sort and Merge sort.  ...  is Quick Sort is internal sort as Merge sort is external sorting.  ... 
doi:10.5120/21847-5155 fatcat:m5v2qa32nnbkfdrpbm4fqmoz4u

Many-sorted and single-sorted algebras

Anna Mućka, Anna B. Romanowska, Jonathan D. H. Smith
2013 Algebra Universalis  
This paper specifies a detailed, fully type-based general method for translating the class of all pure, many-sorted algebras of a given constant-free type into an equivalent variety of single-sorted algebras  ...  The complexity of the identities defining the variety is a linear function of the number of sorts and the arity of the fundamental operations. Presented by J. Adamek.  ...  Particularly troublesome are the many-sorted algebras that are not "pure," mixing empty and non-empty sorts.  ... 
doi:10.1007/s00012-013-0224-5 fatcat:bd3xriw4xjax3azbmj7e3xjnhe

Comparison of Bucket Sort and RADIX Sort [article]

Panu Horsmalahti
2012 arXiv   pre-print
The RADIX sort was not quicker with already sorted inputs, but the bucket sort was.  ...  It was found that bucket sort was faster than RADIX sort, but that bucket sort uses more memory in most cases. The sorting algorithms performed faster with smaller integers.  ...  Bucket sort and RADIX sort are integer sorts, which are used to sort a sequence of integers instead of the more general comparison sorts.  ... 
arXiv:1206.3511v1 fatcat:kptyzaa7prhqtd7jb6w74l4oxu
« Previous Showing results 1 — 15 out of 5,276,160 results