time complexity
4 articles · search the full text for this term
-
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
-
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
-
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
-
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