Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
In this article, we will explain how to delete an element from a set in C++ by passing its value. A set stores elements in sorted order, where each element is unique and cannot be modified once added. While the values cannot be changed, we can add or remove elements using the erase() function from the C++ Standard Library (STL). For example, if we have a set of integers: {1, 2, 3, 4, 5} and want to remove the element 3, we can use the erase() function. After the operation, the set will be {1, 2, 4, 5}, ... Read More
In this article, we'll discuss how to call the main() function in a C program. The main() function is the starting point and runs automatically when the program begins. However, there may be situations where you need to call it from other parts of your code. We'll explain how this works. We'll also cover recursion in the main() function and different ways to call main() within a C program. What is the Main Function? In C, the main() function is a special function that acts as the starting point of the program. Every C program must have one main ... Read More
In this article, we will learn how to calculate Fibonacci numbers efficiently using dynamic programming in C++. The Fibonacci sequence starts with 0 and 1, and each next number is the sum of the two preceding ones. The basic recursive method works but becomes very slow for larger numbers because it repeats the same calculations many times. Dynamic programming solves this by storing the results of previous calculations, which makes the process much faster and more efficient. For example, if we want to find the 6th Fibonacci number, the sequence will look like this: F(0) = 0 ... Read More
In this problem, we need to generate all reverse permutations of a given array using C++'s Standard Template Library (STL). A permutation is simply rearranging the elements of the array in every possible order. For example, with an array of three elements, there are six possible ways to arrange them. For each of these permutations, we need to reverse the order of the elements and then print the results. The goal is to first generate all possible permutations of the array, then reverse each one before displaying them. Example Scenario: Let's say we have the array {1, 2, 3}. ... Read More
In this article, we will learn how to print prime numbers from 1 to N in reverse order. A prime number is a number greater than 1 that has no positive divisors other than 1 and itself. Our goal is to find all prime numbers in the given range from 1 to N and then print them in reverse order. For example, given N = 20, the prime numbers between 1 and 20 are: 2, 3, 5, 7, 11, 13, 17, 19 The output should be the prime numbers printed in reverse order: 19, 17, 13, 11, 7, 5, ... Read More
In this article, we will learn how to access and update the last element of a vector in C++. A vector in C++ is a dynamic array that can adjust its size automatically, allowing us to store and manage a collection of elements. Sometimes, we need to access or update the last element for tasks like changing data or performing calculations. Let's look at a simple example to better understand: Given a vector: std::vector vec = {10, 20, 30, 40, 50}; The last element of the vector is 50. If we want to update the last element to 100, ... Read More
Bubble sort is comparison based sorting algorithm. It works by going through the list, comparing each pair of numbers, and swapping them if they are in the wrong order. This process is repeated until the list is sorted. The name "bubble sort" comes from the way smaller numbers move to the front of the list, like bubbles rising to the top. While bubble sort is easy to understand, it is not the most efficient way to sort numbers. Other sorting methods, like insertion sort, tend to work faster and handle larger lists better. One good thing about bubble ... Read More
The problem is to sort a vector in descending order using C++'s Standard Template Library(STL). Sorting in descending order means rearranging the elements of the vector so that the largest elements come first, followed by smaller elements, all the way down to the smallest element at the end of the vector. Let's say we have the following vector of integers: vector v = {4, 2, 9, 1, 7}; We want to sort this vector so that the elements are arranged in descending order: v = {9, 7, 4, 2, 1}; In this article, we will show you how ... Read More
The problem is to sort an array using C++'s Standard Template Library (STL). Sorting an array means rearranging its elements in a specific order. In this case, we aim to sort the elements in both ascending and descending order, using the built-in functionalities of the STL. Let's say we have the following array of integers: int arr[] = {4, 2, 9, 1, 7}; The goal is to sort this array so that the elements are ordered from smallest to largest (ascending) and largest to smallest (descending): Ascending: arr = {1, 2, 4, 7, 9} Descending: arr = {9, 7, ... Read More
Introduction GET parameters passing in Laravel by forms is used in many web applications. GET parameters are most often used to filter data or even keep a search query after page transitions and to pass some information among pages. Having a good understanding of how to properly pass GET parameters to Laravel forms makes data handling smoother for better user experience.In this tutorial, different ways of passing GET parameters to Laravel forms through the GET method, with some best practices and actual examples, are discussed. Problem Statement The default method of Laravel forms is POST. However, when it comes to ... Read More