Skip to content

Latest commit

 

History

History
77 lines (53 loc) · 1.98 KB

README.md

File metadata and controls

77 lines (53 loc) · 1.98 KB

DS Toolbox

⬆️⬆️ My collection of Structured Algorithms and Data Structures ⬆️⬆️

Description

This repository is a collection of implementations of various data structures and algorithms in different programming languages. It is designed to be a resource for students, programmers, and anyone interested in learning more about these fundamental concepts of computer science.

Features

  • A wide variety of data structures and algorithms, including:

    • Linked lists
    • Stacks
    • Queues
    • Trees
    • Graphs
    • Sorting algorithms
    • Searching algorithms

  • Implementations in multiple programming languages, including:

    • C++
    • Java
    • Python

  • Clear and concise code with detailed comments

  • Well-documented examples

Benefits

  • Learn how to implement and use data structures and algorithms in different programming languages
  • Improve your problem-solving skills
  • Gain a deeper understanding of computer science concepts
  • Prepare for coding interviews

Getting started

To get started, simply clone the repository and explore the code. You can also run the examples to see how the data structures and algorithms work.

Contributing

We welcome contributions to this repository. Please submit pull requests with new implementations, bug fixes, or improvements to the existing code.

License

This repository is licensed under the MIT License.

#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>

using namespace std;

int main() {
  // Create a vector of strings
  vector<string> words = {"Don't", "forget", "to", "star", "and", "share", "it"};

  // Shuffle the vector of strings randomly
  random_shuffle(words.begin(), words.end());

  // Create an iterator to iterate through the vector
  vector<string>::iterator it = words.begin();

  // Continuously output the next word in the vector until reaching the end
  while (it != words.end()) {
    cout << *it << " ";
    it++;
  }

  cout << endl;

  return 0;
}