My Crossword Maker Logo
Powered by BrightSprout
Save Status:
or to save your progress. The page will not refresh.
Controls:
SPACEBAR SWITCHES TYPING DIRECTION
Answer Key:
Edit a Copy:
Make Your Own:
Crucigrama Sopa de Letras Hoja de Trabajo
Calificar este Puzzle:
Log in or sign up to rate this puzzle.

DAA Crossword

Horizontales
______________ is the basic principle in Rabin Karp Algorithm
___________ search algorithm is the fastest algorithm in string matching field
Depth First Search is equivalent _______ traversal
who invented the shell sort algorithm?
Merge sort uses ______________ technique to implement sorting?
__________ search can be used in an insertion sort algorithm to reduce the number of comparisons
Using __________ operator’s instead of arithmetic operators saves time and space.
___________ sort is a variation of Heap sort
What is the basic principle behind Bellmann Ford Algorithm?
Dijkstra’s Algorithm is the prime example for __________ Algorithm
Verticales
The Data structure used in standard implementation of Depth First Search is?
For the best-case input, the running time of an insertion sort algorithm is
The Data structure used in the standard implementation of Breadth-First Search is?
Heap sort is based on
The Depth First Search traversal of a graph will result into ______
Quicksort uses ______ operation rather than merge operation.
Rabin Karp Algorithm makes use of _____________ number theoretic notions
Which sorting algorithm is best suited to sort an array of 1 million elements?
Bellmann Ford algorithm returns _______ value
Floyd Warshall Algorithm can be used for finding ___________ Closure
Bellmann Ford Algorithm is an example for ______________ Programming