This repository contains a collection of C# algorithms designed for learning and practicing basic to intermediate programming concepts.
- Bubble Sort - Sorts an array by repeatedly swapping adjacent elements if they are in the wrong order.
- Selection Sort - Selects the smallest element from an unsorted array and swaps it with the first unsorted element.
- Insertion Sort - Builds the final sorted array one item at a time, inserting each item in its correct position.
- Merge Two Sorted Arrays - Merges two sorted arrays into one sorted array.
- Quick Sort - A divide-and-conquer algorithm that sorts by partitioning the array around a pivot element.
- Find Second Largest Element - Finds the second largest element in an array.
- Find Missing Number - Finds the missing number in a given sequence.
- Prime Number Check - Determines whether a number is prime or not.
- Reverse a String - Reverses the characters in a string using a two-pointer technique.
- Binary Search - Efficiently searches for a target element in a sorted array.