GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — hacking-tools-scriptss/Java/FloydAlgorithm at main · sanscript-tech/hacking-tools-scriptss

Expand file tree

/

FloydAlgorithm

/
Copy path

Directory actions

More options

More options

Directory actions

More options

More options

Latest commit

 

History

History
History
 
 
/

FloydAlgorithm

/
Copy path

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
FloydAlgo.java
FloydAlgo.java
 
 
README.md
README.md
 
 

README.md

Outline

Sample Input:

5

1 6 3 7 8

2

Sample Output:

Loop exists

Explaination:

4--> size of linked list

1-->6-->3-->7-->8 =>nodes of linked list

2---> node to be checked


after creating the loop the detect loop fuction is called and the two pointer slow and fast meets if loop exists . For better understanding,refer here:

Time complexity:

O(n)

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.