diff --git a/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md b/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md index 892e364e1..f02181aba 100644 --- a/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md +++ b/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md @@ -1,6 +1,6 @@ # Bellman Ford's Algorithm -Bellman ford's algorithm is a graph algorithm that finds the shortest path from a source vertex to all other vertices in a graph. It is a dynamic programming algorithm that uses a bottom-up approach to find the shortest path. It is similar to Dijkstra's algorithm but it can handle negative weights. It is also similar to Floyd-Warshall's algorithm but it can handle negative weights and it is faster than Floyd-Warshall's algorithm. +Bellman-Ford's algorithm is a graph algorithm that finds the shortest path from a source vertex to all other vertices in a graph. It is a dynamic programming algorithm that uses a bottom-up approach to find the shortest path. It is similar to Dijkstra's algorithm but it can handle negative weights. Floyd-Warshall's algorithm can handle negative weights as well, but it finds the shortest paths between all pairs of vertices in O(V³) time, while Bellman-Ford's algorithm finds them from a single source in O(V·E) time. Visit the following resources to learn more: diff --git a/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md b/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md index a024a16a8..e838dca3d 100644 --- a/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md +++ b/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md @@ -1,6 +1,6 @@ # Big Endian -Big endian is the most common type of endianness. In this type, the most significant byte is stored at the lowest memory address. This means that the most significant byte is stored first and the least significant byte is stored last. +Big endian is a type of endianness in which the most significant byte is stored at the lowest memory address. This means that the most significant byte is stored first and the least significant byte is stored last. It is the dominant byte order in networking protocols, where it is called network byte order, while most processors, such as x86 and most ARM implementations, are little endian. Visit the following resources to learn more: diff --git a/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md b/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md index 77d85739b..ea9295424 100644 --- a/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md +++ b/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md @@ -1,6 +1,6 @@ # Hashing Algorithms -Hashing algorithms are used to generate a unique value for a given input. This value is called a hash. Hashing algorithms are used to verify the integrity of data, to store passwords, and to generate unique identifiers for data. +Hashing algorithms map an input of any size to a fixed-size value called a hash. Since there are far more possible inputs than hash values, two different inputs can produce the same hash, which is called a collision; a good cryptographic hashing algorithm makes collisions hard to find. Hashing algorithms are used to verify the integrity of data, to store passwords, and to generate unique identifiers for data. Visit the following resources to learn more: diff --git a/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md b/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md index 08474b34c..5186937fb 100644 --- a/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md +++ b/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md @@ -1,6 +1,6 @@ # Skip Lists -Skip lists are a data structure that allows you to perform operations on a sorted list in O(log n) time. Skip lists are a probabilistic data structure, which means that the probability of a certain operation taking a certain amount of time is a certain value. In the case of skip lists, the probability of an operation taking O(log n) time is 1. +Skip lists are a data structure that allows you to search, insert and delete in a sorted list in O(log n) time on average. Skip lists are a probabilistic data structure: the level of each element is chosen at random, so O(log n) is the expected time of an operation, not a guarantee. In the worst case, an operation takes O(n) time. Visit the following resources to learn more: