OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix randomlevel float conversion

Browse Source
This commit is contained in:
Krishna Vedala 2020-07-12 17:47:57 -04:00
parent c15c962f02
commit 47f5ad9aaf
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/skip_list.cpp
View File

@ -41,7 +41,7 @@ struct Node {
* @param key is number that is used for comparision * @param key is number that is used for comparision
* @param level is the maximum level node's going to added * @param level is the maximum level node's going to added
*/ */
Node(int key, int level, void* value = nullptr) : key(key) { Node(int key, int level, void* value = nullptr) : key(key), value(value) {
// Initialization of forward vector // Initialization of forward vector
for (int i = 0; i < (level + 1); i++) { for (int i = 0; i < (level + 1); i++) {
forward.push_back(nullptr); forward.push_back(nullptr);
@ -74,7 +74,7 @@ class SkipList {
*/ */
int randomLevel() { int randomLevel() {
int lvl = 0; int lvl = 0;
while (static_cast<float>(std::rand() / RAND_MAX) < PROBABILITY && while (static_cast<float>(std::rand()) / RAND_MAX < PROBABILITY &&
lvl < MAX_LEVEL) lvl < MAX_LEVEL)
lvl++; lvl++;
return lvl; return lvl;
@ -185,7 +185,7 @@ class SkipList {
* Display skip list level * Display skip list level
*/ */
void displayList() { void displayList() {
std::cout << "Displaying list:\n" << std::endl; std::cout << "Displaying list:\n";
for (int i = 0; i <= level; i++) { for (int i = 0; i <= level; i++) {
std::shared_ptr<Node> node = header->forward[i]; std::shared_ptr<Node> node = header->forward[i];
std::cout << "Level " << (i) << ": "; std::cout << "Level " << (i) << ": ";