Preprocessing: A method For Reducing Time Complexity

Clicks: 1
ID: 313261
2022
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal

Ranked #692 of 705 articles by views in Journal of Computing & Biomedical Informatics

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 705 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Data can be processed quickly if it is in some order, whereas unsequenced data can take more time to obtain results. Sorting is used for data arrangement. It is also one of the essential requirement for most applications and this step helps to boost performance. Sorting is also a prerequisite in several computer applications like databases. Over time computer scientists have not only introduced new sorting techniques considering various factors to be improved but they have also presented enhanced variants of existing sorting methods. The main objective has always been to reduce the execution time and space of the sorting algorithms. With every passing day, digital content is growing rapidly, which is a significant cause that encourages researchers to design new time-space efficient sorting algorithms. This paper presents some preprocessing strategies for quicksort and insertion sort to improve their performances. Tha main idea of using these preprocessings is to make input data more suitable for sorting algorithm, as most sorting function performs extraordinary for a specific type of input, such as insertion sort works better on nearyly sorted data. To authenticate the efficiency of existing sorting algorithms, these have been compared with proposed preprocessing strategies. The results with proposed techniqes outperforms the results of original sorting methods. It also helps to convert worst case into average case. By using this approch complexity of many algorithms can be reduced, therfore this is very important.
Reference Key
imported_1777060107_69ebc90b8b477 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Abbas Mubarak, Sajid Iqbal, Qaisar Rasool, Nabeel Asghar, Neetu Faujdar, Abdul Rauf
Journal Journal of Computing & Biomedical Informatics
Year 2022
DOI
10.56979/401/2022/55
URL
https://jcbi.org/index.php/Main/article/view/55
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.