samyakpagariya fcfe35c3d8
For the better understanding of time taken. (#6583)
* For the better understanding of time taken.

In this change I have initialized a variable p with the value of (1e9+7) and then took the modulus of process time with it . This modification gives better time taken by the process . Firstly it was giving answer in the exponential now it gives in the integer form.

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Apply suggestions from code review

Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com>

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com>
2022-10-30 11:43:41 +01:00
..
2020-10-03 20:49:08 +05:30
2020-11-25 09:54:31 +01:00
2022-10-29 08:26:19 +02:00
2020-10-15 13:45:17 +02:00
2022-10-29 08:26:19 +02:00
2021-09-07 13:37:03 +02:00
2022-10-30 10:08:54 +01:00
2021-02-26 09:01:50 +08:00
2021-09-07 13:37:03 +02:00
2019-10-18 08:13:58 +02:00
2020-05-17 22:48:39 +02:00
2019-07-30 18:06:48 +02:00
2020-09-25 09:18:00 +02:00

Sorting Algorithms

Sorting is the process of putting data in a specific order. The way to arrange data in a specific order is specified by the sorting algorithm. The most typical orders are lexical or numerical. The significance of sorting lies in the fact that, if data is stored in a sorted manner, data searching can be highly optimised. Another use for sorting is to represent data in a more readable manner.

This section contains a lot of important algorithms that helps us to use sorting algorithms in various scenarios.

References