Elasticsearch For .NET Developer : How to work with Elasticsearch using c#

In this post, we are going to take a look at how to integrate Elasticsearch with .NET so that it can be useful in your .NET based projects. This post is part 3 of the series “elasticsearch for .net developer”. Before proceeding, I strongly recommend to check out previous parts listed below: Part 1 : Elasticsearch for .NET Read more about Elasticsearch For .NET Developer : How to work with Elasticsearch using c#[…]

Elasticsearch For .NET Developer : Installing and Configuration

In this post, we will guide you how to quickly set up and running single instance elasticsearch in windows operating system. This post is part 2 of the series “elasticsearch for .net developer”. Before proceeding, I strongly recommend to check out previous post Part 1 : Elasticsearch for .NET Developer – What and Why Elasticsearch You Read more about Elasticsearch For .NET Developer : Installing and Configuration[…]

Elasticsearch For .NET Developer : What and Why Elasticsearch ?

What is ElasticSearch ? Elasticsearch is an open source, NoSQL, distributed, and highly scalable full text search database that is built on top of Lucene, a search engine library written in Java. It provides extremely fast searches and makes data discovery easy. It’s a NoSQL database because it’s a document based storage system instead of using tables and Read more about Elasticsearch For .NET Developer : What and Why Elasticsearch ?[…]

Linked List – Data Structures and Algorithms using C#

In Previous article, Data Structures and Algorithms using C# – Array  we saw that although arrays provide good performance for static collections of data, they had certain disadvantages as data storage structures. In an un-ordered array, searching is slow, whereas in an ordered array, insertion is slow. In both kinds of arrays, deletion is slow. Read more about Linked List – Data Structures and Algorithms using C#[…]

Queue – Data Structures and Algorithms using C#

A queue is a First In First Out (FIFO) data structure. A queue is the most common which you encounter in daily-life as well. For example :  Standing in line for money withdraw at an ATM where the first person in the line is the person to be served first; the last one to be served Read more about Queue – Data Structures and Algorithms using C#[…]

Stack – Data Structures and Algorithms using C#

In our previous article Data Structures and Algorithms using C# – Array , we learnt arrays data structure and the operations performed on them. The various elements can be accessed from any position stored in an array. Some practical applications require that the additions or deletions be done only at one end. For example : Browser Read more about Stack – Data Structures and Algorithms using C#[…]

Arrays – Data Structure and Algorithm using c#

In this article, you will learn the Array data structure – a straightforward and powerful data structure that can store and arrange data in a specific format to fix some type of complex problems. You can use it to store many variables of the same type, such as int, string, etc. We will also look Read more about Arrays – Data Structure and Algorithm using c#[…]

Binary Search Algorithm Using C#

Binary search is the most popular and efficient search algorithm used to solve problems. It tries to find the desired element in a list by dividing the list into left and right sub-lists. Think of this as our childhood game : guessing a number between 1 and 100 played by us where we used to guess Read more about Binary Search Algorithm Using C#[…]

Linear Search Algorithm using C#

Linear search, also known as sequential search, is the most simplest and least performance searching algorithm. Literally, It checks every element in the list sequentially until the desired element is found or until all the elements have been searched. Think of it as finding a contact number in your phone. You starts searching from starting in the list and Read more about Linear Search Algorithm using C#[…]

Merge Sort – Data Structures and Algorithms using C#

Merge sort is an efficient sorting algorithm that uses a divide-and-conquer approach to sort a given set of elements. It works by recursively splitting list into several sub-lists until each sub-list consists of a single element and merging those sub-lists in a manner that results into a sorted list.. For example, an array of 8 elements would be split in the Read more about Merge Sort – Data Structures and Algorithms using C#[…]