Skip to content

Latest commit

 

History

History
241 lines (226 loc) · 5.43 KB

File metadata and controls

241 lines (226 loc) · 5.43 KB

Results of GPT-3.5 on HumanEval/82

Date: 18 July, 2023
Model: gpt-3.5-turbo
Temperature: 0.2
Passing runs: 10
Total runs: 10
Success rate: 100%

Prompt

Tokens: 107

def prime_length(string):
    """Write a function that takes a string and returns True if the string
    length is a prime number or False otherwise
    Examples
    prime_length('Hello') == True
    prime_length('abcdcba') == True
    prime_length('kittens') == True
    prime_length('orange') == False
    """

The above is an incomplete Python code fragment. Return the complete and correct code with no additional text.

Correct solution

def prime_length(string):
    """Write a function that takes a string and returns True if the string
    length is a prime number or False otherwise
    Examples
    prime_length('Hello') == True
    prime_length('abcdcba') == True
    prime_length('kittens') == True
    prime_length('orange') == False
    """l = len(string)
    if l == 0 or l == 1:
        return False
    for i in range(2, l):
        if l % i == 0:
            return False
    return True

Unit tests

def check(candidate):

    # Check some simple cases
    assert candidate('Hello') == True
    assert candidate('abcdcba') == True
    assert candidate('kittens') == True
    assert candidate('orange') == False
    assert candidate('wow') == True
    assert candidate('world') == True
    assert candidate('MadaM') == True
    assert candidate('Wow') == True
    assert candidate('') == False
    assert candidate('HI') == True
    assert candidate('go') == True
    assert candidate('gogo') == False
    assert candidate('aaaaaaaaaaaaaaa') == False

    # Check some edge cases that are easy to work out by hand.
    assert candidate('Madam') == True
    assert candidate('M') == False
    assert candidate('0') == False

Runs

✅ Run 1

Start time: 2023-07-18 17:15:15
Duration: 2.89s
Completion tokens: 68
Result: Pass

import math

def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True

def prime_length(string):
    return is_prime(len(string))

✅ Run 2

Start time: 2023-07-18 17:15:12
Duration: 3.19s
Completion tokens: 69
Result: Pass

def prime_length(string):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n ** 0.5) + 1):
            if n % i == 0:
                return False
        return True

    return is_prime(len(string))

✅ Run 3

Start time: 2023-07-18 17:15:09
Duration: 3.11s
Completion tokens: 73
Result: Pass

import math

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True

def prime_length(string):
    length = len(string)
    return is_prime(length)

✅ Run 4

Start time: 2023-07-18 17:15:06
Duration: 3.0s
Completion tokens: 69
Result: Pass

def prime_length(string):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n ** 0.5) + 1):
            if n % i == 0:
                return False
        return True

    return is_prime(len(string))

✅ Run 5

Start time: 2023-07-18 17:15:03
Duration: 2.8s
Completion tokens: 68
Result: Pass

import math

def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True

def prime_length(string):
    return is_prime(len(string))

✅ Run 6

Start time: 2023-07-18 17:14:59
Duration: 3.63s
Completion tokens: 69
Result: Pass

def prime_length(string):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n ** 0.5) + 1):
            if n % i == 0:
                return False
        return True

    return is_prime(len(string))

✅ Run 7

Start time: 2023-07-18 17:14:56
Duration: 2.77s
Completion tokens: 62
Result: Pass

import math

def prime_length(string):
    length = len(string)
    if length < 2:
        return False
    for i in range(2, int(math.sqrt(length)) + 1):
        if length % i == 0:
            return False
    return True

✅ Run 8

Start time: 2023-07-18 17:14:53
Duration: 2.85s
Completion tokens: 62
Result: Pass

import math

def prime_length(string):
    length = len(string)
    if length < 2:
        return False
    for i in range(2, int(math.sqrt(length)) + 1):
        if length % i == 0:
            return False
    return True

✅ Run 9

Start time: 2023-07-18 17:14:50
Duration: 3.27s
Completion tokens: 69
Result: Pass

def prime_length(string):
    def is_prime(n):
        if n <= 1:
            return False
        for i in range(2, int(n ** 0.5) + 1):
            if n % i == 0:
                return False
        return True

    return is_prime(len(string))

✅ Run 10

Start time: 2023-07-18 17:14:47
Duration: 2.91s
Completion tokens: 62
Result: Pass

import math

def prime_length(string):
    length = len(string)
    if length < 2:
        return False
    for i in range(2, int(math.sqrt(length)) + 1):
        if length % i == 0:
            return False
    return True