# Recent posts tagged algorithm

17 0 2 min.
Introduction problem solving in data structure: Structure pointers are widely used as function arguments. The main reason for their use is the same as in the use of simple variables. Can be changed in the same way. As you may have already done with...
18 0 2 min.
**#Whiсh Seаrсh Аlgоrithm shоuld be used оn lаrge аrrаys if sрeed is imроrtаnt?#** ======================================================================== Hi, In this роst, we will leаrn аbоut the seаrсh аlgоrithm whоse sрeed is fаst ...
7 0 1 min.
Introduction: How can I use the sorting algorithm through my program. If I want to sort some numbers, it is very important to know selection sort, bubble sort, insertion sort. I should know how they work. If you are learning programming then you wi...
3 0 9 min.
The  eаsiest  wаy  tо  sоlve  а  Rubik's  Сube  Раrt  IIHi this article is part II of The  eаsiest  wаy  tо  sоlve  а  Rubik's  Сube to see the part I click ...
0 0 6 min.
The  eаsiest  wаy  tо  sоlve  а  Rubik's  Сube Part IА  Rubik's  сube  is  а  three-dimensiоnаl  tоy  оr  рuzzle  thаt  саme  intо  existenсe ...
18 0 2 min.
Introduction:How can I use the sorting algorithm through my program. If I want to sort some numbers, it is very important to know selection sort, bubble sort, insertion sort. I should know how they work.  If you are learning programming then you...
25 1 1 min.
Types of Algorithms are : Search Algorithm Sort Algorithm Search Algorithm On each day, we search for something in our day to day life. Similarly, with the case of computer, huge data is stored in a computer that whenever the user asks for ...
22 0 3 min.
Approaches used after considering both the theoretical and practical importance of designing an algorithm:Brute force algorithm: The general logic structure is applied to design an algorithm. It is also known as an exhaustive search algorithm that se...
17 0 1 min.
Factors of an Algorithm Modularity: If any problem is given and we can break that problem into small-small modules or small-small steps, which is a basic definition of an algorithm, it means that this feature has been perfectly designed for the...
17 0 1 min.
An algorithm is a process or a set of rules required to perform calculations or some other problem-solving operations especially by a computer. The formal definition of an algorithm is that it contains the finite set of instructions which are being c...
4 1 1 min.
Data Structure is a way to store and organize data so that it can be used effectively. The data structure name indicates itself that organizing the data in memory. There are many ways of organizing the data in the memory as we have already seen o...
0 0 3 min.
Question:if c is a set with c elements, how many elements are in the power set of c? explain your answer.Answer:The power set will have 2^c elements.This is because while generating the powet set, we have two choices for each element in the original ...
0 0 2 min.
By the definition, a number can be called as a prime if it is divisible only by itself and 1. Here we have to find all primes in between 1 and 100. So that the range of given numbers is starting from 1 and ending with 100.Formula to find prime number...
27 2 2 min.
In computer science, divide and conquer is often a solving problem approach where we divide the info set in to parts then combine the sub-part to urge the answer to the most data set. for instance quick-sort, merger-sort and binary search.On the othe...
6 0 1 min.
Algorithm for sorting numbers in ascending order Let the values be store in an array "a" Let n = a.length for ( i = 0 ; i < n ; i ++ ) { // Find array element with min. value among a[i], a[i+1], ..., a[n-1] ...
3 0 2 min.
Explanation of the problemGiven a set of numbers, we have to find the number of subsets that sum to a particular value. This is one among the classic problems. the thought is to seek out the amount of possible sums with the present number. And its tr...
0 0 3 min.
Programming data structures and algorithms using python The knowledge of Data Structures and Algorithms forms the base to identify programmers giving yet another reason for tech enthusiasts to get a Python Certification. While data structur...
0 0 1 min.
Difference between dijkstra and bellman ford algorithmThe primary contrast between Dijkstra's calculation and Bellman Ford's calculation is Negative Cycle Detection. Bellman-Ford can track down the negative cycle though Dijkstra can...
0 0 3 min.
If the system does not use a deadlock prevention or remediation algorithm , a deadlock situation may occur. In this case-Apply an algorithm to check the system state to determine if a deadlock has occurred or not.Ap...
3 3 2 min.
What is O(log n)Logarithmic time period ( O(log n) ) essentially means the time period grows in proportion to the logarithm of the input size - as an example, if 10 items takes at the most some amount of your time x , and 100 items takes at the most ...