Server Side Programming Articles - Page 308 of 2650

Ranging a query is a common database current interest operation present in data structure to restore all the records where the output value lies between an upper and lower boundary. This process works with some input data, to structure them in an efficient manner on any subset of a particular input. The range function, denoted as range(), is used to iterate a for loop over a series. We need to declare the start as 0 at the beginning of a process. If somehow we miss this step, the process will run and iterate the loop until the end (-1). A ... Read More

Dynamic programming is an optimization algorithmic technique to solve the particular problems by splitting them into some simple sub problems. It is a procedure by which we can combine the quality, condition, or fact of a complete search for a greedy algorithm being exact and accurate. But this method is an oxymoron itself because it comes with a great advantage and that is also its biggest disadvantage and limitation too. We can divide a problem into some sub problem but we can't divide the sub problems again. They should be solvable by its own. The concept of the sub problems ... Read More

Inversion count is a step counting method by which we can calculate the number of sorting steps taken by a particular array. It is also capable to count the operation time span for an array. But, if we want to sort an array in a reverse manner, the count will be maximum number present in that array. Array: { 5, 4, 3, 2, 1} // for the reverse manner Pairs: {5, 4}, {5, 3} , {3, 2}, {3, 1}, {2, 1}, {4, 3}, {4, 2}, {4, 1}, }, {5, 2}, {5, 1} Output: 10 Array: {1, 2, 3, 4, ... Read More

Deque or double ended queue is a sequential linear collection data queue that provides the function like a double-ended queue. In this data structure the method does not follow the First In First Out (FIFO) rule for data treatment. This data structure is also known as double-ended queue because the elements are inserted to the end of the queue and removed from the front. For a deque we can add and remove data only from both ends. The time complexity of the deque operation is O(1). There are two types of deque − Input Restricted Restriction at a ... Read More

A linked list is a chain alike linear data structure, where the elements are not saved at memory in an adjacent manner, unlike array. In a particular linked list, the elements are linked with the next element by a pointer. In simple words; a linked list is a series of some data containers where we can find a path way or a reference link in those elements to the next node. There is a head pointer present as the first element in a linked list. If the first node of that particular list is empty then it points nothing or ... Read More

A string is a particular object, which represents a sequence and flow of data characters. The strings are the data container which always represented as a text format. It also used to concept, compare, split, join, replace, trim, length, intern, equals, comparison, substring operation. A substring() is a data refining process, which extracts the saved data of between two positions from start to end. A substring () does not change the original string. In a data set when we have different characters, they can be denoted as distinct data elements. For example: 'a' and 'r' are distinct while 'r' ... Read More

In a C++ environment, iteration statement is a compound or cause statement which can be executed zero or more than one at a time. This process is subjected to a loop termination process. The statement executes in a particular order when there is a presence of break statement or the continuation of a statement. There are four types of iteration present in C++ - While Do For Range-based for Every loops mentioned here iterates a particular condition until its termination. The expression evaluates as zero when the statement. The iteration statements can't be considered as declaration. In ... Read More

Transforming a string aka string transformation is an operation in C++ by which the result stores in an output array after the execution of the whole process. In C++ there is a function called "transform()", present in the directory of the C++ environment by which we can transform a string into a new one. There are two forms of this transform function − Unary operation Operation applies on the every element of the input array. After the operation being done the result will store in an output array. Binary operation Operation applies on each element ... Read More

Every year on 7th May the worldwide organizations remind there users about the significance of a strong password. As per the tech giant Google; 24% of their end users have used the word "password" or "Qwerty" as their account password. While, only 34% from their total users change their account passwords in a frequent manner. In this tech-forward world today, every login attempt has a chance of a cyber criminal attack. But many people now a days still using the weak passwords for their professional and personal accounts. Here we will discuss and check, whether the created passwords ... Read More

In this Golang article, we will explore how to implement Dijkstra's Algorithm to find the shortest path between two nodes in a graph using an Adjacency Matrix as well as using an Adjacency List. Dijkstra's Algorithm is used to solve the single-source shortest path problem in a graph with non-negative edge weights. Algorithm Step 1 − First, we need to import the fmt and math packages. Then create a dist array of length n (the number of nodes in the graph) and initialize it with math.MaxInt32. This array will store the shortest distance from the starting node to every ... Read More