Search
388 articles for “time complexity”
-
Impact of Time Complexity Using Array and Linked List in Data Structure
Abstract: Data structures are techniques for maintaining, manipulating, and storing data on a computer, enabling efficient access and modification. They support various operations, such as insertion, deletion, updating, and sorting. Examples of data structure include arrays, linked lists, graphs, heaps, stacks, and queues. Each data structure is designed to meet specific needs and solve particular problems. Typically, we identify the problem, devise a solution as an algorithm, and then write an …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 41–48 Read article
-
Rainwater Measuring Algorithm in O(1) Time Complexity
Abstract: The Rain Terraces Time Complexity Data Structure Algorithm (RTTCDSA) introduces a novel method for managing temporal data efficiently, inspired by the natural flow of rainwater on terraced landscapes. This study presents the conceptual framework and implementation details of RTTCDSA, which leverages principles of temporal dynamics and landscape morphology to organize and query temporal data with optimal time complexity. RTTCDSA employs a hierarchical structure akin to terraced landscapes, facilitating rapid traversal …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 1, 2024 · pp. 26–32 Read article
-
Searching Substring in O(n) Time Complexity
Abstract: This research paper presents a highly efficient algorithm for substring search within a given string, achieving a remarkable time complexity of O(n). The proposed algorithm utilizes a two-pointer approach to compare the given string with the targeted substring. By employing string concatenation, the algorithm dynamically constructs a resultant substring during the matching process. Upon completion of character matching, the algorithm compares the resultant substring with the targeted substring and returns …
Published in International Journal of Algorithms Design and Analysis Review · Vol. 1, Issue 1, 2023 · pp. 9–15 Read article
-
Primality Testing: A Comprehensive Analysis of Methods and Time Complexity
Abstract: This paper examines various primality testing algorithms and analyzes their time complexity. The algorithms we examine include the trial division, which is straightforward but becomes inefficient with large numbers; Fermat’s little theorem which is a probabilistic method included in Monte Carlo type of randomized algorithm; the Solovay–Strassen, based on properties from number theory, particularly those related to Euler’s criterion and Jacobi symbols; and the Miller–Rabin Probabilistic Test, which balances efficiency …
Published in International Journal of Algorithms Design and Analysis Review · Vol. 2, Issue 2, 2024 · pp. 25–31 Read article
-
Data Recovery Using Brute Force Algorithm: A Review
Abstract: This article delves into the intriguing field of data recovery, with a particular emphasis on the brute force approach, a powerful yet frequently underappreciated method. We begin by exploring the evolution of data recovery techniques since the 1970s and 1980s, examining traditional methods used to retrieve lost or corrupted data. Following this historical perspective, the article provides a brief overview of various methodologies employed in data recovery, including techniques that …
Published in Journal of Computer Technology & Applications · Vol. 15, Issue 3, 2024 · pp. 10–16 Read article
-
Complex Space-Time and the Structure of Relativistic Quantum Theory
Abstract: Relativistic quantum mechanics was developed to reconcile the principles of quantum mechanics with Einstein’s theory of relativity. Despite its success in describing high-energy particles, the theory continues to face unresolved conceptual and mathematical difficulties, particularly in relation to the nature of time, causality, and relativistic consistency. In recent years, the idea of extending space-time into the complex domain has emerged as a useful and potentially meaningful approach to these problems. …
Published in Recent Trends in Mathematics · Vol. 3, Issue 1, 2026 · pp. 22–27 Read article
-
Learning Data Structures: Key to Good Programming
Abstract: Data structures are the most crucial feature of good programming and are needed to solve hard computational problems. This model makes use of two different recurrent neural network architectures, specifically long short-term memory (LSTM), and gated recurrent unit (GRU) networks. It explains how selecting and using the correct data structures may speed up computations, optimize memory, and scale code. How data structures and algorithms relate and how to think about …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 29–39 Read article
-
Competitive Programming and Its Importance in the Present World
Abstract: Competitive programming has become a vital skill set for both computer science students and professionals, fostering problem-solving abilities, algorithmic thinking, and time management in a highly competitive environment. This paper provides a comprehensive overview of competitive programming, beginning with its core principles and progressing through advanced strategies used by participants to solve complex problems efficiently. In addition to explaining fundamental concepts, the paper explores key algorithms and data structures frequently …
Published in Recent Trends in Parallel Computing · Vol. 11, Issue 3, 2024 · pp. 39–50 Read article
-
An Auxiliary Array Indexing Approach for Efficient Binary Search in Linked Lists
Abstract: The paper covers an algorithm for searching a linked list structure using binary search. Binary search is a classic example of an algorithm that follows the divide-and-conquer approach. Binary search may be used to find elements in an array. Trying to apply the conventional binary search to a linked list simply does not work out very well; it still has an O(n) time complexity, the same as linear search. This …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 21–28 Read article
-
Parallel Greedy Approach for Phylogenetic Tree Construction in the Context of Marine Species
Abstract: The rebuilding of phylogenetic trees for marine species shows major computing problems because of the massive genomic data and the huge biodiversity inherent in ocean ecosystems. Traditional phylogenetic methods are accurate but become more expensive when they are processing with thousands of marine taxa parallelly. This article shows a critical analysis of parallel greedy algorithms as an adaptable solution for large-scale marine phylogenetics. It examines the main principles of greedy …
Published in International Journal of Algorithms Design and Analysis Review · Vol. 4, Issue 1, 2026 · pp. 33–45 Read article
-
Comprehensive Analysis of Counting by Sorting
Abstract: Sorting algorithms play an important role in computer science, as they facilitate the effective organization and retrieval of data. Counting sort is a non-comparative integer sorting algorithm that works well with a limited number of integers known beforehand. The process, advantages, and limitations of this sorting algorithm were investigated in this study. Unlike other comparison-based sorting algorithms, counting sort achieves a time complexity of O(n+k), which depends on the input …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 11, Issue 2, 2024 · pp. 1–6 Read article
-
A research study into the interactions between the monoherbal formulations of arjuna and Aloe vera in a rat model of isoproterenol-induced cardiotoxicity
Abstract: Aloe vera is a herbal dietary supplement, and arjuna is used for its cardioprotective properties. Rats were given isoproterenol hydrochloride subcutaneously to cause myocardial infarction. The purpose of the study was to identify any potential pharmacodynamic interactions between the commercially available formulations of Aloe vera and arjuna. Materials and Procedures: The electrocardiogram (heart rate, ST segment elevation time, QRS complex amplitude), serum cardiac markers (creatine kinase, isoform of creatine kinase, …
Published in International Journal of Toxins and Toxics · Vol. 2, Issue 2, 2025 · pp. 1–10 Read article
-
Comparative Study of Time Slice Windows Analysis and Impacted As-Planned Analysis for Data Center Construction Projects Using Primavera P6 24.12 Version
Abstract: Data centers are IT infrastructure that needs to be precisely scheduled and coordinated. Significant financial losses and operational failures may result from building delays. Stakeholders can assign blame and comprehend the reasons behind delays with the aid of forensic delay analysis. Because of their unique approaches and legal acceptability, TSWA, and IAPA are commonly used among the many strategies. These methods provide various ways to analyze project schedules and pinpoint …
Published in Journal of Construction Engineering, Technology & Management · Vol. 16, Issue 1, 2026 · pp. 33–51 Read article
-
FEA Simulation for Optimization of Laminated Composite Plate with Cutout in Free Vibrations
Abstract: Laminated composites have a large application in engineering. The work done in this study is to see the free vibration response of graphite epoxy composite square plate subjected to different boundary conditions. Finite element analysis has been done on the software ANSYS. The results obtained by the simulation have been compared with those obtained from a published data obtained by semianalytical solution. It is observed that the solutions through ANSYS …
Published in Journal of Experimental & Applied Mechanics Read article
-
Self-Healing Structural Polymer Composites Incorporating Bio-Inspired Nanofillers
Abstract: Self-healing polymer composites become an attractive family of intelligent materials that are capable of autonomously repairing damage, which will enhance their durability, reliability and service life in extreme engineering applications. The materials are based on the principles of nature, using the nanofillers that are derived from biological systems to improve mechanical properties and self-healing capabilities by utilizing hierarchical structures and multifunctional interface interactions. The recent developments on the formulation of …
Published in Journal of Polymer & Composites · Vol. 14, Issue 4, 2026 Read article
-
Machine Learning Assisted Timing Violation Prediction in Sub-7nm VLSI Physical Design
Abstract: The continuous scaling of semiconductor technology into the sub-7nm regime has introduced significant challenges in timing closure due to process variability, interconnect delay, power density, and manufacturing uncertainties. Conventional static timing analysis techniques often require extensive computational resources and iterative optimization cycles, resulting in increased design complexity and longer turnaround time. This research proposes a Machine Learning Assisted Timing Violation Prediction framework for sub-7nm VLSI physical design to improve early-stage …
Published in International Journal of VLSI Circuit Design & Technology · Vol. 4, Issue 1, 2026 Read article
-
DFT Compatible Low Power EDAC Based on Clock Gating
Abstract: The in-situ EDAC architecture is normally hired in timing-error tolerant circuits in a try and decrease the conservative timing protect band due to procedure, voltage, and temperature (PVT) fluctuations. But with the addition of the latch-based totally data channel, extra detection, and propagation common sense, it makes the implementation of the layout for- testability (DFT) tough. We present a new low area test overhead DFT EDAC architecture with extreme reduction …
Published in International Journal of VLSI Circuit Design & Technology · Vol. 3, Issue 1, 2025 · pp. 41–53 Read article
-
Algorithmic Strategies for Complex Data Handling: Optimizing Data Structures for Enhanced Computational Performance
Abstract: We live in an age of big data and processing very large often complicated datasets can be crucial to efficient algorithmic performance. This paper discusses different algorithmic techniques when working with difficult data and how to arrange your information structures correctly for better functionality in large-scale methods. It checks the impact of different algorithms like sorting, searching, and hashing in boosting its processing speed as well as memory use. This …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 1–10 Read article
-
Asymptotic Notations: A Review
Abstract: Asymptotic notations play a fundamental role in assessing the efficiency and performance of algorithms, particularly as input sizes grow larger. This paper delves into three key asymptotic notations: Big O, Theta, and Omega, which are essential for understanding the upper, average, and lower bounds of an algorithm’s runtime. Big O notation specifically helps in determining the worst-case scenario of an algorithm’s growth rate, providing an upper bound on time or …
Published in Journal of Computer Technology & Applications · Vol. 15, Issue 3, 2024 · pp. 17–33 Read article
-
History and Applications of Kalman Filter: A Review
Abstract: The Kalman filter is a powerful algorithm that is used to estimate the dynamic system states with noisy measurements and uncertain behaviors. It is an optimal estimator that minimizes the average squared error between the estimated states and the true states, given the noisy data and a model of the system. The recursive algorithm is highly effective in tracking and predicting the state of complex systems over time. Kalman filters …
Published in International Journal of Electrical Power and Machine Systems · Vol. 2, Issue 1, 2024 · pp. 14–23 Read article