Skip to content

Latest commit

 

History

History
27 lines (22 loc) · 674 Bytes

File metadata and controls

27 lines (22 loc) · 674 Bytes

Data Structures in C++

This is my study repository.

Repository contents

  • Simple Search Algorithm
  • Binary Search Algorithm
  • Stack
  • Queue
  • Bubble Sort
  • Insertion Sort
  • Selection Sort
  • Quick Sort
  • Shell Sort
  • Merge Sort
  • Sequential List Operations
  • Linked List Operations

Other Information

  • Queue: FIFO: First In - First Out.
  • Stack: LIFO: Last In - First Out.
  • Merge Sort: Works well for large lists.
  • Quick Sort: Fast and efficient method for large lists. Good for when we don't know the state of the list.
  • Selection Sort: Good for small arrays.
  • Shell Sort: Allows swapping values that are far apart. Works well for large lists.