<h3>Sorting</h3>
The term “sorting” is used to refer to the process of arranging the data in <u>ascending or descending order</u>.
Example: Statistical data collected can be sorted alphabetically or numerically based on the value of the data.
<h3>Filtering</h3>
The process of data filtering involves selecting a <u>smaller part of your data set to view or analyze</u>. This is done by using that subset to view or analyze your data set as a whole.
Example: A complete set of data is kept, but only a portion of that set is used in the calculation, so the whole set is not used.
<em>Hope this helps :)</em>
Answer:
False
Explanation:
A regular language can be represented by a regular expression. A regular language can be infinite. Let us consider a simple example of an infinite regular language:
a* is a regular language represented by a regular expression.
The languages matches all strings containing or more a's.
Clearly this is an infinite language.
Note that all finite languages are regular but all regular languages need not be finite.
