Consider the following type declarations
Two types are Structurally Equivalent if types of their each component are same and are in same order as well.
Type A1 is integer
Type A2 is pointer to float. We know that pointer is always integer type so A2 is also integer
Type A3 is pointer to integer. Pointer is always integer type so A3 is also integer.
Type T1 is structure with one component of integer type. This will be treated as integer only.
Type A1, A2, A3 and T1 all are having structural equivalence.
Type T2 is structure with two components. First is of type A1 which means integer and second is pointer to integer.
Type T3 is structure with two components. First is integer type and second is float type.
Type T4 is structure with two components. First is float type and second is integer type.
Type T2, T3 and T4 are not having structural equivalence between any pair of them.
Type T5, T6, T7 and T8 all are having structural equivalence because each of them have three components of integer types (pointers are of type integer).
Type T9 and T10 both are having structural equivalence because they are having same number of components and structurally equivalent components.
Consider the following type declarations TYPE A A Ti 12 T3 T4 TS TO T7 TH...
I need the report like this (idea) *Sorting Algorithms: A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonical zing data and for producing human-readable output. More formally, the output must satisfy...