Search for a command to run...
Series
In this series you will be able to grab some knowledge about DSA
DSA-Python We are going to see Data Structures and Algorithms parallel and I will use Python language for code implementations. Algorithms: A sequence of finite steps to perform some tasks. Example : Multiplications of two numbers Properties of Algor...
we have some steps to construct an algorithms, In those steps analysis is the last one. But before start the Problem solving we need to study the analysis part very well then only we can see our algorithms works well or not. To find optimized code we...
Recurrence Relation Definition of Recurrence: Function is calling itself directly or indirectly. def fact(n): if n==0 or n==1: ## o! = 1 and 1! = 1 return 1 else: return n*fact(n-1) There are three type of recurrence relation, Subs...
Data Structures There are so many data structures available for solving different kind of problems, we can see them below. Array - Searching Linked List - Insertion and Deletion Dictionary/Hash Map - Mapping of Key values Tree and Graph - Networking...
Array: A collection of items in a contiguous manner. Python list based on array data structures. Array index always starts from 0 and ends at n-1 where n is length of an array. Each index have own address ( in hexadecimal format). In array we can a...
Array Sorting Already we saw definition of array in last post, and we also take some application of array's. Sorting is also one of the application of array. There are multiple Sorting methods available, we see one by one in this post. We can classif...
