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.

Section 6 - Crossword

Horizontales
This sorting algorithm can prove very fast when sorting very small lists - even faster than the quicksort algorithm
A data _________ is a collection of data organized so that you can perform operations on it in the most efficient way
The process of putting the elements of a list in a certain order
In a square matrix, the collection of those elements that runs from the top-right corner to the bottom-left corner
Another name for the sequential search algorithm
It is considered one of the best and fastest sorting algorithms
A Python data structure
A search algorithm
Verticales
A sorting algorithm
Its elements can be uniquely identified using a key and not necessarily an integer value
A mechanism to select a range of elements from a list
This sorting algorithm performs well on computer systems in which limited main memory (RAM) comes into play
Each list element is assigned a unique number known as a(n) _____
These brackets are used to create a list
A mutable data structure in Python
In this diagonal, the elements have their row index equal to their column index