Algorithms and data structure

Hello everyone✌️

I want to show my work. These are algorithms and data structures
Github repo

Content

• Stack
• Queue
• Merge Sort
• Quick Sort
• Binary Search
• Linked List
• Breadth First Search (BFS)
• Depth-first search (DFS)

Stack

A stack is a last-in, first-out (LIFO) data structure. This implementation introduces basic stack operations such as adding an element, removing an element, and checking if the stack is empty.

Queue

A queue is a first-in, first-out (FIFO) data structure. This implementation introduces basic queue operations such as adding an element, removing an element, and checking if the queue is empty.

Merge sort

Merge sort is a sorting algorithm that uses a split-and-merge strategy. It splits the list into halves, sorts them separately, and then combines the sorted halves into one sorted list. This implementation introduces merge sort in Python and C#.

Quick sort

Quicksort is a sorting algorithm that uses a divide and conquer strategy. It selects an element (the pivot) from the array and rearranges the remaining elements so that the elements to the left of the pivot are smaller than it, and the elements to the right are larger. The process is then repeated recursively for the two subarrays to the left and right of the pivot. This implementation introduces quicksort in Python and C#.

Binary search

Binary search is a search algorithm that operates on a sorted list. It compares the search value with the element in the middle of the list, and, depending on the result of the comparison, continues searching either in the left or right half of the list. This implementation introduces binary search in Python and C#.

Linked list

A linked list is a data structure consisting of nodes, each of which contains a value and a link to the next node. This allows you to efficiently add and remove items from a list. This implementation introduces basic linked list operations such as adding an element, removing an element, and getting the size of the list.

Breadth first search

Breadth-first search (BFS) is a graph traversal or search algorithm that starts at a given vertex and traverses all vertices breadth-first before moving to the next depth. This implementation introduces breadth-first search in Python and C#.

Depth-first search

Depth-first search (DFS) is a graph traversal or search algorithm that starts at a given vertex and goes deep into the graph until it reaches a final vertex or backtracks if a dead-end path is reached. This implementation introduces depth-first search in Python and C#.