also called Sequential Search) is the simplest searching algorithm, Linear Search, is an efficient searching algorithm that works only on sorted lists., Binary Search, It repeatedly divides the search interval in half:, Binary Search, It checks each element one by one until it finds the target or reaches the end of the list., Linear Search, Works on both sorted and unsorted data., Linear Search, How fast it runs, Time Complexity, How much memory it uses, Space Complexity, Time Complexity uses, Big-O notation, O(1), Constant Time, O(n), Linear Time, O(log n), Logarithmic Time, O(n²), Quadratic time, O(2ⁿ), Exponential time, tells us how an algorithm scales when data gets bigger., Complexity analysis, Repeatedly compare adjacent elements and swap if they’re out of order. , Bubble Sort, Find the smallest element and put it at the beginning, repeat for the rest., Selection Sort, Take elements one by one and insert them in the correct position in the sorted portion., Insertion Sort, A divide-and-conquer algorithm, Merge Sort, Pick a pivot, partition array so elements less than pivot go left, greater go right, then recursively sort sublists., Quick Sort, is a special data structure that stores key–value pairs., hash table, a unique identifier, key, the data you want to store, value, is the process of converting a key into a number, Hashing, key into a number, Hash Code, Hashing uses, Hash function, Sometimes, two keys map to the same slot, Collisions, Store multiple items in a small list (linked list or array) at that slot., Chaining, If slot is full, try the next available slot., Open Addressing, data structure that stores key–value pairs for fast access., Hash Table, process of converting a key into an index using a hash function., Hashing, happen when two keys map to the same slot., Collision, chaining or open addressing., Solutions , fast and efficient (O(1) average)., Performance.

data structure

par
Imprimer
Incorporer

Classement

Style visuel

Options

Changer de modèle

)
Restauration auto-sauvegardé :  ?