0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is one interesting fact about conglomerate rocks?
The clasts in conglomerate can be sorted, partially sorted, or unsorted.
How can a glacier deposit both unsorted and sorted materials?
it all comes together.
What is grain sorting?
Grain sorting is used in the observation of geological specimens such as sands.Sorting refers to the distribution of grain sizes in a rock.There are 2 classifications of sorting.Well sorted = All grains in the rock are the same size. (e.g desert sandstone)Poorly sorted = A mixture of grain sizes. (e.g Sandstone mixed with clay or gravel mixed with sand)Well sorted sands result from long transport where unstable minerals have been winnowed out. They have higher porosity and permiability.Poorly sorted material is the result of rapid deposition of sediment without sorting by currents of wind or water.
How are till and outwash different?
Basically till is unsorted and outwash is sorted. Outwash is sorted by the melt water streams, which have the ability to smooth rocks and pebbles. The till is carried by the glacier which means that all sorts of rocks and boulders can be carried with the ice, creating sharp surfaces on the rocks.
What is a glacial till?
glacial till is the stuff deposited from a glacier.
Do kettle lakes contain sorted or unsorted sediments?
sorted
How does sorting of rock particles affect porosity of rocks?
poorly sorted = low porosity well sorted = high porosity
Is an outwash plain sorted or unsorted?
outwash is sorted because it is running water
What is one interesting fact about conglomerate rocks?
The clasts in conglomerate can be sorted, partially sorted, or unsorted.
How can a glacier deposit both unsorted and sorted materials?
it all comes together.
Which of the following materials probably has the lowest porosity 1 Well sorted fine grained sediment 2 Well sorted coarsegrained sediment 3 Unfractured granite 4 Sand with well?
well sorted coarse grained sediment
What are unsorted sediments?
\sediments that are in a body of water that are not sorted by their type of sediment. for example, if there were cobbles, pebbles, and silt, in a lake, that would be unsorted
What factors affect porosity?
The larger the particle size, the higher the porosity. Also keep in mind that angular particles have a higher porosity than round particles. *Good way to remember porosity is that the spaces between particles are "pore-like."
What is ordering in DBMS?
changing of unsorted list to sorted list in a ordering from alphabets, numbers, ASC/DESC.
What is the difference between sediments in the outwash and sediments in the moraines?
Sediments that are in outwash are sorted sediments, organized by size, while sediments that are in moraine are unsorted.
How are materials sorted?
We sort materials by classifying them into certain groups.
What is the code for sorting in C plus plus?
There are many sorting algorithms. One of the simplest to implement is the insertion sort. The following template function will sort an array of any type T that supports the less-than operator. It works by splitting the array into two subsets, where the left portion is sorted and the right is unsorted. Initially, the sorted portion has just one element since a set of one element can always be regarded as being sorted. We then work our way through each of the unsorted elements, from left to right, inserting them into their correct place in the sorted portion. To do this we need to store the current unsorted value thus creating a gap at the beginning of the unsorted portion. This gap then becomes the last element of the sorted portion, reducing the unsorted portion by one element. We then work our way through the sorted elements starting with the element to the left of the gap. If the stored value is less than the current element's value then we copy that element into the gap, thus moving the gap one position to the left. We continue in this manner until gap is at index 0 or the stored value is not less than the element to the left of the gap. We then place the stored value in the gap. We repeat this for all unsorted elements until there are none left, at which point the array is completely sorted. template<typename T> void sort(std::vector<T>& v) { if( v.size()>1 ) { for( size_t i=1; i<v.size(); ++i ) { T t = v[i]; size_t gap=i; while( gap && t<v[gap-1] ) v[gap]=v[gap--]; v[gap]=t; } } }
