Algorithms
Across
- 3. start to end in short distance
- 6. finding in half
- 7. in place sorting
- 8. using hash function to reduce comparison
- 9. sequence of steps
- 11. way to reach early
- 13. middle step in an algorithm approach with three steps
- 17. finding high profit problem
- 19. false matching
- 20. all less than top most
- 21. a brute force approach of pattern matching
Down
- 1. greedy approach
- 2. a mathematical relation
- 4. roundtrip cost
- 5. way of multiplying matrices
- 10. finding low cost problem
- 12. dynamic programming
- 14. max items to hold
- 15. finding all pairs way
- 16. a variable code encoding
- 18. list of nodes
- 22. addition value equal to target value