1 citations · 1 across the 4 of their papers we have counts for
4 papers
Binar Shuffle Algorithm: Shuffling Bit by Bit
William F. Gilreath
Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within…
Binar Sort: A Linear Generalized Sorting Algorithm
William F. Gilreath
Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted…
XString: XML as a String
William F. Gilreath
Extensible markup language (XML) is a technology that has been much hyped, so that XML has become an industry buzzword. Behind the hype is a powerful technology for data representa…
Hash sort: A linear time complexity multiple-dimensional sort algorithm
William F. Gilreath
Sorting and hashing are two completely different concepts in computer science, and appear mutually exclusive to one another. Hashing is a search method using the data as a key to m…