By Salah.Saad, history, 3 weeks ago,

The Algorithm or Algorithms was named after Muhammad bin Musa Al-Khwarizmi, the Arab mathematician, and what is meant by algorithms in the field of programming are the steps that we use to solve the problems that we meet. And that's it And of course, there is a basis in his book, the algorithm, not anything, and that's it, I can say about it algorithm 1- Simplicity: This is an important thing in writing any algorithm so that I, as a programmer, can turn it into code that I really use. The simpler the steps you use, the easier it is for you to use them later

2 General: And here what is meant by it is that when I create an algorithm, I do it in a way that I can use it on a large scale. I mean, for example, I can’t say 1 + 2 = 3. This is an algorithm because it has a limited scale, which is only these two numbers. But it is possible that x + y = z is an algorithm. So I can use any number and it will do exactly the same job 3- Efficiency: And here we will need to understand the concept of efficiency in programming, and this is in order to be able to measure the efficiency of any algorithm, and the main factor here is the time.

So, do we understand from this statement that there are really existing algorithms that I can use? Oh, of course, there are very many, but we will take simple examples from them, so that it does not prolong you more than that

1- Sort Algorithms or ranking algorithms The arrangement algorithm is one of the most studied and researched algorithms in the field of computer science in general. Its aim is to arrange a large number of elements in a specific order, so that it will be easier for me after that to connect it. Of course, you can write it in any programming language that you use. The most important thing is to understand its principle and one of the most important algorithms. arrangement Merge Sort Quick Sort Heap sort Bubble Sort 2- The Search Algorithms or search algorithms And this is used to search for a specific element in a place, whether it is databases or array objects, for example, and one of the most famous examples of it is binary search or binary search, and this depends on dividing the elements in half each time until we reach the element to look for it Of course, there are many examples of algorithms, but we will suffice with these for now SALAH

• -12

By Salah.Saad, history, 3 weeks ago,

Whenever I need anything in the world and feel that it is difficult or helpless, I think of how many million people other than me have achieved it; I move and say to my mind, what is the problem, that those who have achieved more than just a million and one! So I work and force myself to reach. #### salah

• -18

By Salah.Saad, history, 4 months ago,

Night, worries and problems belong to you alone! What does it mean, my good sir! It means the problems of your life, your work, and everything that concerns you, are exactly the same for millions of others. What differentiates one from the other is that each person tries to solve his problems according to his level of awareness and management of matters. One solves problems intelligently and with less losses. And someone solves his problems the hard way, but he reaches in the end. And someone makes impulsive decisions and creates bigger problems and spirals that don't end. Roots of the problem Roots of the problem. etc. The steps to solve any problem in the world begin with realization, then analysis, then developing solutions that suit the situation Each stage is based on the one before it, so if you do well, you will do well for the one that follows it Perception comes with teaching, teaching, patience and calmness And those who are distinguished by these qualities are the smartest in solving problems

#### salah

• -17

By Salah.Saad, history, 4 months ago,

# Definition

The term problem solving has a slightly different meaning depending on the discipline. For instance, it is a mental process in psychology and a computerized process in computer science. There are two different types of problems: ill-defined and well-defined; different approaches are used for each. Well-defined problems have specific end goals and clearly expected solutions, while ill-defined problems do not. Well-defined problems allow for more initial planning than ill-defined problems.[2] Solving problems sometimes involves dealing with pragmatics, the way that context contributes to meaning, and semantics, the interpretation of the problem. The ability to understand what the end goal of the problem is, and what rules could be applied represents the key to solving the problem. Sometimes the problem requires abstract thinking or coming up with a creative solution.

#### Eng salah.

• -16

By Salah.Saad, history, 7 months ago,

Sets are containers that store unique elements following a specific order.

In a set, the value of an element also identifies it the value is itself the key, of type T, and each value must be unique. The value of the elements in a set cannot be modified once in the container the elements are always const, but they can be inserted or removed from the container.

Internally, the elements in a set are always sorted following a specific strict weak ordering criterion indicated by its internal comparison object of type Compare.

set containers are generally slower than unordered_set containers to access individual elements by their key, but they allow the direct iteration on subsets based on their order.

Sets are typically implemented as binary search trees.

• +6