You are on page 1of 3

Running Head: ALGORITHMS AND APPLICATIONS 1

Algorithms and Applications

Student Name

Tutor’s Name

Date
ALGORITHMS AND APPLICATIONS 2

The most important lesson I have learnt from this module is that most of the problem in

life are computationally too complex and impossible to find an optimum solution in a timely

manner. Therefore we often have to sacrifice our goals by relaxing general constraints to come

up with a solution that is feasible and acceptable, though not optimum (Hua & Lau, 2017). I

found sorting concept interesting as well as easy to grasp unlike creating algorithm. Systems use

different concepts to operate hence need different algorithms, it was challenging for me to define

logic in some systems

Sorting is arranging items in a particular order so as to access them easily in later times.

We apply sorting in our day to day life either knowingly or unknowingly in several instances.

Our telephone directories, English dictionaries are some examples in which names or words are

arranged in alphabetical order (Mehlhorn, 2018). Aside from making things look nice for

humans, it is also used to make things nice for other systems. Some systems perform better if

given sorted data. For example, a transmission system that is not IP based and doesn't have an

equivalent mechanism like slow start. Data must be sorted from smallest to largest per batch to

avoid starvation.
ALGORITHMS AND APPLICATIONS 3

Reference

Hua, Q., & Lau, F. C. (2017). Rendezvous in distributed systems: Theory, algorithms and

applications. Springer.

Mehlhorn, K. (2018). Data structures and algorithms 1: Sorting and searching. Springer Science

& Business Media.

You might also like