# UdaySk  ## Time and Space Complexities from code

Introduction Finding the Time and Space Complexities from codes of a piece of code is an important step in understanding its performance and optimizing it for efficiency. In this article, we will explore the basic concepts of time and space complexity, and how to determine them from a given piece of code. Time Complexity Time … ## TO CHECK WHETHER THE GIVEN NUMBER IS PRIME NUMBER OR NOT￼

INTRODUCTION Given an integer n, write a program TO CHECK WHETHER THE GIVEN NUMBER IS PRIME NUMBER OR NOT Some more prime numbers are 2,3,5,7,11,13,17,19,23,29,31,37,41,43 and so on. APPROACH1 A prime number is a natural number which is only divisible by 1 and itself. So if we divide the number by running a loop from … ## Must do pattern problems before starting DSA￼

In this article we are going to learn about the following content:- What are pattern problems? Why are they useful before starting DSA? Initial pattern code. Explanation. Must do pattern problems before starting DSA What are pattern problems? Almost everything we see in our daily life has a certain pattern to it i.e. stars have … ## physical vs logical data structures

Introduction In this article, let’s have a look at physical vs logical data structures. Physical DataStructures Physical data structures are the actual implementations of data structures in memory. They determine the performance and efficiency of algorithms that use the data structure, by determining how the data is stored and accessed in memory. For example, a …  