Category: C#

In this article, I will provide some Basic Programs in Solidity. Hello World Program. Simple Math Operations. Simple Storage. Structs and Arrays. Mapping. Function Modifiers. Inheritance. Events. Payable Functions. Time-Based Functions. Random Number Generation. Enums. Further Reading Some Examples of MongoDB Documents 20 Project Ideas on Finance in PHP for College Students Getting Started with …

The following article explains How to Secure Docker Containers and Images. In fact, securing Docker containers and images is an important aspect of using Docker in production environments. The following list shows some best practices for securing Docker containers and images. Use official images. Use official Docker images whenever possible, as they are more likely …

The following article describes A Struts Application for Form Handling. In order to understand how a struts application works with a form, we create an application for the same. The following problem statement, we use here. An HTML form for a Cultural Event accepts these fields: Team title, event name like solo singing, group singing, …

This following article explains how to implement Heap Sort in C#. What is Heap Sort? In brief, Heap sort is a comparison-based sorting algorithm that sorts an array by using a binary heap data structure. Moreover, it’s an efficient and stable sorting algorithm. Evidently, it has a time complexity of O(n log n). Actually, the …

The following article describes How to Implement Quick Sort in C#. What is Quick Sort? It must be remembered that, Quick Sort is a divide-and-conquer algorithm for sorting an array of elements. It works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, depending on whether they are …

This article explains How to Implement Merge Sort in C#. In fact, Merge Sort is a divide and conquer algorithm that sorts an array by recursively dividing it into two halves, sorting the two halves individually. Then merging the two sorted halves back into one final sorted array. Meanwhile, the merging process involves comparing elements …

This article explains Selection Sort in C#. Like Bubble Sort and Insertion Sort, Selection Sort is also a simple sorting technique. Furthermore, selection sort also works by dividing the list into sorted and unsorted part. Unlike, insertion sort, selection sort finds minimum element from the unsorted list and puts it at the beginning. Further, the …

This article explains Insertion Sort in C#. Another simple sorting algorithm is the Insertion Sort. Basically, this algorithm works by first virtually dividing the list in two parts. While, the first part belongs to the sorted list, the other part is unsorted. Further, the agorithm picks an element from the unsorted part and inserts it …

This article explains Bubble Sort in C#. Basically, Bubble Sort is the most simple sorting algorithm. In general, bubble sort works by scanning each element of a list. Further, it checks the order of adjacent elements in the list. If the algorithm finds that the adjacent elements are in wrong order, it swaps these elements. …