for i in range(start,end): RecursionError: maximum recursion depth exceeded in comparison [closed]

-2

def quicksort(arr):

    quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex-1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

python

share|improve this question

edited Jan 2 at 9:55

Rakesh

40.6k124274

asked Jan 2 at 9:54

Kora69Kora69

31

closed as off-topic by meowgoesthedog, iBug, Rory Daulton, gnat, EdChum Jan 2 at 12:17

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Questions seeking debugging help ("why isn't this code working?") must include the desired behavior, a specific problem or error and the shortest code necessary to reproduce it in the question itself. Questions without a clear problem statement are not useful to other readers. See: How to create a Minimal, Complete, and Verifiable example." – meowgoesthedog, iBug, EdChum

If this question can be reworded to fit the rules in the help center, please edit the question.

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  You should describe the problem better by giving a descriptive title and then stating your doubt in the question body.
  
  – Parag S. Chandakkar
  Jan 2 at 9:58
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  The problem with your code is that the line quick(arr, pindex - 1, end) will never end because following your code's logic, pindex - 1 will always be less than end, thus the program will continue recurring. P.S. You would also need to add a return at the end of quick() and quicksort() to make the function return anything.
  
  – Xteven
  Jan 2 at 10:06
  
  
  

  
  
  
  

add a comment | 

-2

def quicksort(arr):

    quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex-1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

python

share|improve this question

edited Jan 2 at 9:55

Rakesh

40.6k124274

asked Jan 2 at 9:54

Kora69Kora69

31

closed as off-topic by meowgoesthedog, iBug, Rory Daulton, gnat, EdChum Jan 2 at 12:17

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Questions seeking debugging help ("why isn't this code working?") must include the desired behavior, a specific problem or error and the shortest code necessary to reproduce it in the question itself. Questions without a clear problem statement are not useful to other readers. See: How to create a Minimal, Complete, and Verifiable example." – meowgoesthedog, iBug, EdChum

If this question can be reworded to fit the rules in the help center, please edit the question.

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  You should describe the problem better by giving a descriptive title and then stating your doubt in the question body.
  
  – Parag S. Chandakkar
  Jan 2 at 9:58
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  The problem with your code is that the line quick(arr, pindex - 1, end) will never end because following your code's logic, pindex - 1 will always be less than end, thus the program will continue recurring. P.S. You would also need to add a return at the end of quick() and quicksort() to make the function return anything.
  
  – Xteven
  Jan 2 at 10:06
  
  
  

  
  
  
  

add a comment | 

-2

-2

-2

def quicksort(arr):

    quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex-1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

python

share|improve this question

edited Jan 2 at 9:55

Rakesh

40.6k124274

asked Jan 2 at 9:54

Kora69Kora69

31

def quicksort(arr):

    quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex-1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

python

python

share|improve this question

edited Jan 2 at 9:55

Rakesh

40.6k124274

asked Jan 2 at 9:54

Kora69Kora69

31

share|improve this question

edited Jan 2 at 9:55

Rakesh

40.6k124274

asked Jan 2 at 9:54

Kora69Kora69

31

share|improve this question

share|improve this question

edited Jan 2 at 9:55

Rakesh

40.6k124274

edited Jan 2 at 9:55

Rakesh

40.6k124274

edited Jan 2 at 9:55

Rakesh

40.6k124274

40.6k124274

asked Jan 2 at 9:54

Kora69Kora69

31

asked Jan 2 at 9:54

Kora69Kora69

31

asked Jan 2 at 9:54

Kora69Kora69

31

31

closed as off-topic by meowgoesthedog, iBug, Rory Daulton, gnat, EdChum Jan 2 at 12:17

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Questions seeking debugging help ("why isn't this code working?") must include the desired behavior, a specific problem or error and the shortest code necessary to reproduce it in the question itself. Questions without a clear problem statement are not useful to other readers. See: How to create a Minimal, Complete, and Verifiable example." – meowgoesthedog, iBug, EdChum

If this question can be reworded to fit the rules in the help center, please edit the question.

closed as off-topic by meowgoesthedog, iBug, Rory Daulton, gnat, EdChum Jan 2 at 12:17

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Questions seeking debugging help ("why isn't this code working?") must include the desired behavior, a specific problem or error and the shortest code necessary to reproduce it in the question itself. Questions without a clear problem statement are not useful to other readers. See: How to create a Minimal, Complete, and Verifiable example." – meowgoesthedog, iBug, EdChum

If this question can be reworded to fit the rules in the help center, please edit the question.

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  You should describe the problem better by giving a descriptive title and then stating your doubt in the question body.
  
  – Parag S. Chandakkar
  Jan 2 at 9:58
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  The problem with your code is that the line quick(arr, pindex - 1, end) will never end because following your code's logic, pindex - 1 will always be less than end, thus the program will continue recurring. P.S. You would also need to add a return at the end of quick() and quicksort() to make the function return anything.
  
  – Xteven
  Jan 2 at 10:06
  
  
  

  
  
  
  

add a comment | 

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  You should describe the problem better by giving a descriptive title and then stating your doubt in the question body.
  
  – Parag S. Chandakkar
  Jan 2 at 9:58
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  The problem with your code is that the line quick(arr, pindex - 1, end) will never end because following your code's logic, pindex - 1 will always be less than end, thus the program will continue recurring. P.S. You would also need to add a return at the end of quick() and quicksort() to make the function return anything.
  
  – Xteven
  Jan 2 at 10:06
  
  
  

  
  
  
  

1

1

You should describe the problem better by giving a descriptive title and then stating your doubt in the question body.

– Parag S. Chandakkar
Jan 2 at 9:58

You should describe the problem better by giving a descriptive title and then stating your doubt in the question body.

– Parag S. Chandakkar
Jan 2 at 9:58

The problem with your code is that the line quick(arr, pindex - 1, end) will never end because following your code's logic, pindex - 1 will always be less than end, thus the program will continue recurring. P.S. You would also need to add a return at the end of quick() and quicksort() to make the function return anything.

– Xteven
Jan 2 at 10:06

The problem with your code is that the line quick(arr, pindex - 1, end) will never end because following your code's logic, pindex - 1 will always be less than end, thus the program will continue recurring. P.S. You would also need to add a return at the end of quick() and quicksort() to make the function return anything.

– Xteven
Jan 2 at 10:06

add a comment | 

1 Answer
1

active

oldest

votes

1

change is in line

quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

otherwise it will stuck in recursion
correct code should be

def quicksort(arr):

    return quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex+1,end) #quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

share|improve this answer

edited Jan 2 at 10:12

prashant rana

943920

answered Jan 2 at 10:08

AviatorXAviatorX

7012

add a comment | 

1 Answer
1

active

oldest

votes

1 Answer
1

active

oldest

votes

active

oldest

votes

active

oldest

votes

1

change is in line

quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

otherwise it will stuck in recursion
correct code should be

def quicksort(arr):

    return quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex+1,end) #quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

share|improve this answer

edited Jan 2 at 10:12

prashant rana

943920

answered Jan 2 at 10:08

AviatorXAviatorX

7012

add a comment | 

1

change is in line

quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

otherwise it will stuck in recursion
correct code should be

def quicksort(arr):

    return quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex+1,end) #quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

share|improve this answer

edited Jan 2 at 10:12

prashant rana

943920

answered Jan 2 at 10:08

AviatorXAviatorX

7012

add a comment | 

1

1

1

change is in line

quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

otherwise it will stuck in recursion
correct code should be

def quicksort(arr):

    return quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex+1,end) #quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

share|improve this answer

edited Jan 2 at 10:12

prashant rana

943920

answered Jan 2 at 10:08

AviatorXAviatorX

7012

change is in line

quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

otherwise it will stuck in recursion
correct code should be

def quicksort(arr):

    return quick(arr,0,len(arr)-1)



def quick(arr,start,end):

    if start < end:

        pindex = partition(arr,start,end)

        quick(arr,start,pindex-1)

        quick(arr,pindex+1,end) #quick(arr,pindex-1,end) => quick(arr,pindex+1,end)

        return arr



def partition(arr,start,end):

    pivot = arr[end]

    pindex = start-1

    for i in range(start,end):

        if arr[i] <= pivot:

            pindex = pindex+1

            arr[pindex],arr[i] = arr[i],arr[pindex]

    arr[pindex+1],arr[end] = arr[end],arr[pindex+1]

    return pindex+1

share|improve this answer

edited Jan 2 at 10:12

prashant rana

943920

answered Jan 2 at 10:08

AviatorXAviatorX

7012

share|improve this answer

share|improve this answer

edited Jan 2 at 10:12

prashant rana

943920

edited Jan 2 at 10:12

prashant rana

943920

edited Jan 2 at 10:12

prashant rana

943920

943920

answered Jan 2 at 10:08

AviatorXAviatorX

7012

answered Jan 2 at 10:08

AviatorXAviatorX

7012

answered Jan 2 at 10:08

AviatorXAviatorX

7012

7012

add a comment | 

add a comment | 

This page is only for reference, If you need detailed information, please check here