Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/jharsh1202/dsa
https://github.com/jharsh1202/dsa
Last synced: 1 day ago
JSON representation
- Host: GitHub
- URL: https://github.com/jharsh1202/dsa
- Owner: jharsh1202
- Created: 2022-02-14T18:45:36.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2022-03-21T18:28:24.000Z (over 2 years ago)
- Last Synced: 2023-08-05T09:52:48.986Z (over 1 year ago)
- Language: C++
- Size: 40 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# DSA*Data Structures*
- array.cpp- *linkedlist.cpp*
- create_linked_list
- print_linked_list
- add_node_at_tail
- add_node_at_head
- find_ll_size
- delete_a_value
- reverse_linked_list
- reverse_linked_list_easy
- reverse_linked_list_easy
- reverse_linked_list_recursive
- reverse_k_linked_list
- reverse_k_linked_list
- find_intersection
- merge_sorte
- put_even_before_odd
- detect_cycle //floyd's cycle detection, hare and tortoise- *circular_linkedlist.cpp*
- create_circular_linkedlist
- add_to_head_circular_linkedlist
- delete_from_head_circular_linkedlist
- print_circular_linked_list
- delete_from_circular_linkedlist- *doubly_linkedlist.cpp*
- create_doubly_linked_list
- print_doubly_linked_list
- insert_at_tail
- insert_at_head
- delete_an_element
- put_last_k_elements_to_front- *binary_tree.cpp*
- *recursion.cpp*
- create_words_from_phone_keys
- print_substring_with_ascii
- print_substring
- move_all_x_to_end
- remove_duplicates //Task 5 do for any kind of string this supports only - - seq duplicates like "aabbccdd"
- tower_of_hanoi //Todo // tower of hanoi (steps prref-1 @13:00
- replace_pi
- print_reverse_string
- reverse_string
- first_occurance_array
- last_occurance_array
- bool isArraySorted
- fibonacci
- factorial
- calculate_n_power_p
- add_sequence
- add_sequence //Task 3: do it without second variable
- print_sequence
- print_sequence_reverse- *searching.cpp*
- Iteration
- Linear Search - O(n)
- Binary Search - O(log(n))- *sorting.cpp*
- Selection Sort - O(n^2) - (find min and swap with first element)
- Bubble Sort - O(n^2) - (swap with next if it's minimum)
- partition
- quicksort
- merge
- merge_sort
- insertion_sortWhat's inside *stdc++.h*
- it's just a header file which is a collection of most included libraries. So you don't have to include all libraries everytime.## 🤝 Contributing
```bash
1. Fork the repository
2. Do the desired changes (add/delete/modify)
3. Make a pull request
```Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
## Author
👤 **Harshit Jain**
✉️ *[email protected]*
- Linkedin: [@harshit1202](https://www.linkedin.com/in/harshit1202/)
- Github: [@jharsh1202](https://github.com/jharsh1202)