The purpose of this paper is to propose a few theoretical improvements over the Huffman coding algorithm used for variable length encoding and data compression. The proposed algorithm works in a similar way as the Huffman algorithm, that is, it assigns a variable length code to each character. However, it makes use of the fact that texts in most languages are composed of words, which occur in varying frequencies and that not all combinations of letters in any language form valid words. To accommodate the improvements, the procedure is slightly modified. At the same time, it is still an improvement over Huffman encoding scheme, hence follows its rules. The binary representations allocated are unique, and no representation is the prefix of another.
Abstract-The purpose of this paper is to propose a new sorting algorithm (tentatively titled Gupta Sort). This inplace, recursive, sorting algorithm with a time complexity of O(n 2), is ideal for sorting integers, floats as well as characters, stored in both arrays and doubly linked lists. It greatly reduces the number of elements we have to compare against to find the correct position of each element, and has performed better than selection sort, insertion sort, and bubble sort for a number of cases. Further, this algorithm can be randomised ensuring that there is no worst case.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.