Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Searching Lattice Data Structures of Varying Degrees of Sortedness   Lattice data structures are space efficient and cache-suitable data
structures. The basic searching, insertion, and deletion operations are of time
complexity $O(\sqrt{N})$. We give a jump searching algorithm of time complexity
$O(J(L)\log(N))$, where $J(L)$ is the jump factor of the lattice. $J(L)$
approaches $4$ when the degree of sortedness of the lattice approaches
$\sqrt{N}$. A sorting procedure of time complexity $O(\sqrt{N})$ that can be
used, during the system idle time, to increase the degree of sortedness of the
lattice is given.

23
The categories of this paper are: solv-int
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
8
The categories of this paper are: hep-ex
18
The categories of this paper are: econ
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci