Grain sizeGrain size (or particle size) is the diameter of individual grains of sediment, or the lithified particles in clastic rocks. The term may also be applied to other granular materials. This is different from the crystallite size, which refers to the size of a single crystal inside a particle or grain. A single grain can be composed of several crystals. Granular material can range from very small colloidal particles, through clay, silt, sand, gravel, and cobbles, to boulders.
Meander cutoffA meander cutoff is a natural form of a cutting or cut in a river occurs when a pronounced meander (hook) in a river is breached by a flow that connects the two closest parts of the hook to form a new channel, a full loop. The steeper drop in gradient (slope) causes the river flow gradually to abandon the meander which will silt up with sediment from deposition. Cutoffs are a natural part of the evolution of a meandering river. Rivers form meanders as they flow laterally downstream, see sinuosity.
Merge sortIn computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.
Longshore driftLongshore drift from longshore current is a geological process that consists of the transportation of sediments (clay, silt, pebbles, sand, shingle) along a coast parallel to the shoreline, which is dependent on the angle of incoming wave direction. Oblique incoming wind squeezes water along the coast, and so generates a water current which moves parallel to the coast. Longshore drift is simply the sediment moved by the longshore current. This current and sediment movement occur within the surf zone.
Bucket sortBucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, a generalization of pigeonhole sort that allows multiple keys per bucket, and is a cousin of radix sort in the most-to-least significant digit flavor. Bucket sort can be implemented with comparisons and therefore can also be considered a comparison sort algorithm.
Selection sortIn computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n2) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity and has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited. The algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list and a sublist of the remaining unsorted items that occupy the rest of the list.
Bed loadThe term bed load or bedload describes particles in a flowing fluid (usually water) that are transported along the stream bed. Bed load is complementary to suspended load and wash load. Bed load moves by rolling, sliding, and/or saltating (hopping). Generally, bed load downstream will be smaller and more rounded than bed load upstream (a process known as downstream fining). This is due in part to attrition and abrasion which results from the stones colliding with each other and against the river channel, thus removing the rough texture (rounding) and reducing the size of the particles.
Radix sortIn computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. For elements with more than one significant digit, this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all digits have been considered. For this reason, radix sort has also been called bucket sort and digital sort. Radix sort can be applied to data that can be sorted lexicographically, be they integers, words, punch cards, playing cards, or the mail.
Oxbow lakeAn oxbow lake is a U-shaped lake or pool that forms when a wide meander of a river is cut off, creating a free-standing body of water. In South Texas, oxbows left by the Rio Grande are called resacas. In Australia, oxbow lakes are called billabongs. The word "oxbow" can also refer to a U-shaped bend in a river or stream, whether or not it is cut off from the main stream. An oxbow lake forms when a meandering river erodes through the neck of one of its meanders. This takes place because meanders tend to grow and become more curved over time.
Bubble sortBubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the input list element by element, comparing the current element with the one after it, swapping their values if needed. These passes through the list are repeated until no swaps had to be performed during a pass, meaning that the list has become fully sorted. The algorithm, which is a comparison sort, is named for the way the larger elements "bubble" up to the top of the list.
