backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-09 15:43:48 +08:00
Code Issues Projects Releases Wiki Activity

Added algorithm and implementation explanations. Also added wikipedia link.

Browse Source
This commit is contained in:
weiss-ben
2022-09-14 23:32:43 +03:00
parent 274cd9e7c3
commit 7c71be9707
1 changed files with 6 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
search/median_search2.cpp
View File

@@ -2,7 +2,12 @@
* @file
*
* @details
* Given a linked list L[0,....,n] of n numbers, find the middle node.
* Given a linked list L[0,....,n] of n numbers, find the middle node.
* The technique utilized in this implementation is the "Floyd's tortise and hare" approach. Wikipedia link to technique: https://en.wikipedia.org/wiki/Cycle_detection#Floyd's_tortoise_and_hare
* This technique uses two pointers that iterate through the list at different 'speeds' in order to solve problems.
* In this implementation, for every iteration the slow pointer advances one node while the fast pointer advances two nodes.
* The result of this is that since the fast pointer moves twice as fast as the slow pointer, when the fast pointer reaches the end of the list
* the slow pointer will be pointing to the middle node of the list.
*
* Here are some example lists you can use to see how the algorithm works
* A = [1,2,3,4,5]