LEARN PROGRAMMING LANGUAGES

ANALYSIS OF ALGORITHM :   In theoretical analysis of algorithms, it is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. The term   "analysis of algorithms"   was coined by Donald Knuth. Algorithm analysis is an important part of computational complexity theory, which provides theoretical estimation for the required resources of an algorithm to solve a specific computational problem. Most algorithms are designed to work with inputs of arbitrary length. Analysis of algorithms is the determination of the amount of time and space resources required to execute it. Usually, the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps, known as  time complexity , or volume of memory, known as  space complexity . The Need for Analysis In this chapter, we will discuss the need for analysis of algorithms and how to choose a better algorithm for a

👉WHAT IS ALGORITHM :  👇 YOU CAN ALSO WATCH VIDEO FOR MORE UNDERSTANDING WHAT IS ALGORITHM :  An algorithm is a set of steps of operations to solve a problem performing calculation, data processing, and automated reasoning tasks. An algorithm is an efficient method that can be expressed within finite amount of time and space. An algorithm is the best way to represent the solution of a particular problem in a very simple and efficient way. If we have an algorithm for a specific problem, then we can implement it in any programming language, meaning that the  algorithm is independent from any programming languages . Algorithm Design The important aspects of algorithm design include creating an efficient algorithm to solve a problem in an efficient way using minimum time and space. To solve a problem, different approaches can be followed. Some of them can be efficient with respect to time consumption, whereas other approaches may be memory efficient. However, one has to keep in mind that

   BEAUTIFUL  DESIGN USING TURTLE IN PYTHON 🐢      👉  how to create Many Beautiful Designs using Python  Turtle  in the same code. The code for the turtle program is given below. Accordingly, this article will explain to you how you can code in turtles that will allow you to create some cool designs. We will first see the code and then, we will understand it line-by-line. Now let’s see the code for design.     👇👇👇👇   CODE : import turtle wn=turtle.Screen() turtle.bgcolor('black') turtle.shape('turtle') tr=turtle.Turtle() ts=turtle.Turtle() tt=turtle.Turtle() t2=turtle.Turtle() t3=turtle.Turtle() t4=turtle.Turtle() t5=turtle.Turtle() move=1 ############################### t5.speed("fastest") for i in range(10):     for i in range(4):           t5.pu()           t5.goto(500,200)           t5.pd()           t5.color('cyan')           t5.pensize(3)           t5.circle(50,steps=4)           t5.right(100) t5.speed("fastest") for i in range(6