Sort computation

Sorting has long been used to organize data in preparation for further computation, but sort computation allows some types of computation to be performed during the sort. Sort aggregation and sort distribution are the two basic forms of sort computation. Sort aggregation generates an accumulative or aggregate result for each group of records and places this result in one of the records. An aggregate operation can be any operation that is both associative and commutative, i.e., any operation whose result does not depend on the order of the operands or the order in which the operations are performed. Sort distribution copies the value from a field of a specific record in a group into that field in every record of that group

Lagging rural areas: detection, diagnosis and planning development

The overall objective of the present paper is to identify and analyse the territorial factors that influence the economy and demography of rural areas in Catalonia. The paper begins with a definition of the different rural typologies, and then proposes an innovative methodology combining tools from different disciplines, such as economics, statistics, geography and sociology. The methodology is applied to the 946 municipalities existing in Catalonia today, which visually results in a map of the region. The map obtained allows us to identify rural spaces throughout the territory – including metropolitan and peri-urban rural areas. The next step has been the analysis of the indicators of their socio-economic development contexts in order to identify their similarities and differences in terms of socioeconomic and territorial characteristics. As a result of applying this methodology, we can deepen our understanding of the factors behind lagging agricultural activity in rural spaces, as well as make progress in the identification of sustainable policies aimed at preventing the environmental, sociological and cultural losses linked to the abandonment of rural activities.Rural space, rural development, lagging rural economy, Community/Rural/Urban Development,

Improving the performance of bubble sort using a modified diminishing increment sorting

Sorting involves rearranging information into either ascending or descending order. There are many sorting algorithms, among which is Bubble Sort. Bubble Sort is not known to be a very good sorting algorithm because it is beset with redundant comparisons. However, efforts have been made to improve the performance of the algorithm. With Bidirectional Bubble Sort, the average number of comparisons is slightly reduced and Batcher’s Sort similar to Shellsort also performs significantly better than Bidirectional Bubble Sort by carrying out comparisons in a novel way so that no propagation of exchanges is necessary. Bitonic Sort was also presented by Batcher and the strong point of this sorting procedure is that it is very suitable for a hard-wired implementation using a sorting network. This paper presents a meta algorithm called Oyelami’s Sort that combines the technique of Bidirectional Bubble Sort with a modified diminishing increment sorting. The results from the implementation of the algorithm compared with Batcher’s Odd-Even Sort and Batcher’s Bitonic Sort showed that the algorithm performed better than the two in the worst case scenario. The implication is that the algorithm is faster