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 learn to implement right right-click menu using JPopupMenu in Java. A JPopupMenu appears anywhere on the screen when the right mouse button is clicked. JPopupMenu A JPopupMenu menu is a free-floating menu that is associated with an underlying component called the invoker. Most of the time, a popup menu is linked to a specific component to display context-sensitive choices. Syntax The following is the syntax for JPopupMenu initialization: JPopupMenu popup = new JPopupMenu(); In order to create a popup menu, we can use the JPopupMenu class., We can add the JMenuItem to the ... Read More
In C++, the new operator is mainly used for allocating memory on the heap, but to initialize that memory, you need to explicitly declare and provide a value to it.Here, the new operator dynamically allocates memory for a variable or object during runtime and returns a pointer to the allocated memory. Here are the following ways you can initialize memory using the new operator: For built-in types For arrays For objects new Operator in Built-in Types The built-in types are the basic data types in C++, which ... Read More
A List in C++ STL library is hardcoded implementation of a doubly linked list data structure. In this article, we will learn how to implement and use a list in C++ . What is List? List is a doubly linked container provided in the C++ STL library, in which each element points to both its previous and next elements. Meaning, in this list we can quickly traverse in both forward and backward direction using pointers just like a doubly linked list. Compared to vectors or arrays, these lists allow fast insertions and deletions from the middle of the sequence. ... Read More
Forward List is a type of singly linked list available in the C++ STL (Standard Template Library). In this artcile, we will learn how to use forward_list from C++ STL library. What is Forward List? Forward list is a linear data structure which allows traversal only in one direction. It is similar to a singly linked list where each element points to the next element and moves in forward direction. It supports operations like insertion, deletion, and traversal from the beginning to end but not in reverse direction. The insertion and deletion operations are comparatively very fast in ... Read More
Deque or Double Ended Queue is a special type of queue where we can insert and delete elements from both front and back. In this article, we will learn how to use deque from C++ STL (Standard Template Library). What is Deque? Deque is a linear data structure in which the insertion and deletion operations can be performed at both the ends (front and rear). Meaning, the data can be inserted at both front and rear positions and can be deleted from both front and rear positions. This gives more flexibility compared to a normal queue which supports only ... Read More
Vectors have the ability to resize itself automatically like dynamic arrays when an element is inserted or deleted, the container handle their storage automatically. The main difference between vector resize() and vector reserve() is that resize() is used to change the size of vector where reserve() doesn’t. reserve() is only used to store at least the number of the specified elements without having to reallocate memory. But in resize() if the number is smaller than the current number then it resizes the memory and deletes the excess space over it. C++ vector::resize() The resize() is used to change the actual ... Read More
In this article, we will learn to convert a list of characters to strings in Java. Sometimes, when we handle character-based data structures, we need to convert a list of characters into a string. Problem Statement Given a list of characters, the task is to convert it into a single string where the order of characters remains unchanged. Input: list = Arrays.asList('W', 'e', 'l', 'c', 'o', 'm', 'e'); Output: Welcome Methods to Convert a List of Characters to a String The following are the different approaches to convert a list of characters to a string in Java - ... Read More
The return statement in Python is used to return a value or a set of values from a function. When a return statement is encountered in a function, the function execution is stopped, and the value specified in the return statement is returned to the caller. Without it, a function simply executes its code but doesn't provide any result back. The return statement allows a function to output a result which can be used later in the program. Why Use the Return Statement? You should use the return statement in the following cases − To ... Read More
The wheel Sieve method is used to find the prime numbers within a given range. Wheel factorization is a graphical method for manually performing a preliminary to the Sieve of Eratosthenes that separates prime numbers from composites. In this method, prime numbers in the innermost circle have their multiples in similar positions as themselves in the other circles, forming spokes of primes and their multiples. Multiple of these prime numbers in the innermost circle form spokes of composite numbers in the outer circles. In this article, we have set the limit to 100. Our task is to implement the ... Read More
The Sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. It follows three simple steps to find the prime numbers. It uses three quadratic expressions that remove the composite numbers. After this, we remove the multiples of squares of already existing prime numbers and at the end, we return the prime numbers. In this article, we have set the limit to '30'. Our task is to implement the Sieve of Atkin method to generate all the prime numbers up to the limit in C++. Here is an example of prime numbers up ... Read More