Searching Algorithms
Sorting Algorithms
In-Built Data Structs.
User Data Structs.
Wildcard
100
This searching algorithm divides your search space by half in each pass.
What is Binary Search?
100
This is the best worst-case time complexity for all sorting algorithms.
What is O(n * log n)
100
This in-build data structure is immutable.
What is a Tuple?
100
This user-defined data structure works like can of tennis balls.
What is a Stack?
100
This is used to stop the program at a certain spot during debugging.
What is a Breakpoint?
200
That is the best-case time complexity for Linear Search.
What is O(1)?
200
This sorting algorithm uses this method for sorting.
What is Merge Sort?
200
This in-build data structures has unique elements.
What is a Set?
200
This module needs to be imported when defining user-defined data structures.
What is Dataclass / Dataclasses?
200
That's the kind of pet I have.
What is a Cat?
300
This is the worst-case time complexity for Binary Search.
What is O(log n)?
300
This function is used to help sort strings alphabetically.
What is ord( )?
300
This object is created when this line of code is created:
s = { }
What is an empty Dictionary?
300
This user-defined data structure is normally used by Stacks, Queues, and LinkedLists.
What is a Node?
300
This was Selitskiy's profession before teaching.
What is an Opera Singer?
400
The total amount of passes done on this list in a worst-case scenario when Binary Search is performed:
[1, 2, 3, ..., 64, 63, 64]
What is 6?
400
These in-built data structures are what CAN be sorted in Python.
What are lists, tuples, and dictionaries?
400
Dictionaries has this pair for its entries.
What is Key and Value pair?
400
Besides using nodes, Stacks and Queues can be implemented using this structure.
What is a List?
400
The Big-O time complexity of counting the number of times a letter a appears in a string of length N.
What is O(n)?
500
This is the implementation for Linear Search.
What is?
for i in range(len(list):
if list[i] is element:
return True
else:
return False
500
The total amount of swaps that occurs when insertion sort is done on:
[5, 1, 3, 9, 6, 7]
What is 4?
500
This is how many times you can have a list inside a list.
What is Infinite? (Or until you run out of memory)
500
The possible data class of this object:
var = Person("Cedric", 21, 5.75, true)
What is?
@dataclass
class Person:
str: name
int: age
float: height
bool: isCool
500
That's my ELO in Chess.
What is 1600?