We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 10 Days of Statistics
  4. Day 1: Quartiles
  5. Discussions

Day 1: Quartiles

Sort by

recency

|

508 Discussions

|

  • komal_sony234
     + 0 comments

    my easy python solution -

    def quartiles(arr): sorted_arr = sorted(arr) n = len(sorted_arr)
    mid = n // 2

    if n % 2 == 0:
    low = sorted_arr[:mid]
    high = sorted_arr[mid:]
    q1 = int(median(low))
    q2 = int(median(sorted_arr))
    q3 = int(median(high))
else:
    low = sorted_arr[:mid]
    high = sorted_arr[mid+1:]
    q1 = int(median(low))
    q2 = int(median(sorted_arr))
    q3 = int(median(high))

return [q1, q2, q3]

  • akulbachandra67
     + 0 comments

    Simple and sweet python solution

    import statistics as s

def quartiles(n,arr):
arr.sort()
m = int(n/2)
a = int(s.median(arr[:m]))
b = arr[m]
c = int(s.median(arr[m+1:]))
if n%2 == 0:
return print(f"{a}\n{b-1}\n{c-1}")
else:
return print(f"{a}\n{b}\n{c}")

  • illogicalsleepi1
     + 0 comments
    def quartiles(n,arr):
    arr=sorted(arr)
    if n%2==1:
        q2=arr[n//2]
        q1=statistics.median(arr[:n//2])
        q3=statistics.median(arr[n//2+1:])
    else:
        q2=(arr[n//2]+arr[n//2-1])/2
        q1=statistics.median(arr[:n//2])
        q3=statistics.median(arr[n//2:])
    return [int(q1),int(q2),int(q3)]

    or

    def find_median(arr):
    n = len(arr)
    if n % 2 == 1:
        return arr[n // 2]
    else:
        return (arr[n // 2] + arr[n // 2 - 1]) / 2

def quartiles(n, arr):
    arr = sorted(arr)
    q2 = find_median(arr)
    if n % 2 == 1:
        lower_half = arr[:n // 2]
        upper_half = arr[n // 2 + 1:]
    else:
        lower_half = arr[:n // 2]
        upper_half = arr[n // 2:]
    q1 = find_median(lower_half)
    q3 = find_median(upper_half)
    return [int(q1), int(q2), int(q3)]

    undefined `

  • [deleted]     + 0 comments
    def quartiles(arr):
    # Sort the array
    arr.sort()
    
    n = len(arr)
    mid = n // 2
    
    # Calculate Q1 (first quartile)
    if n % 2 == 0:
        Q1 = quants(arr[:mid])
    if n % 2 != 0:
        Q1 = quants(arr[:mid])
    
    # Calculate Q2 (median)
    Q2 = quants(arr)
    
    # Calculate Q3 (third quartile)
    if n % 2 == 0:
        Q3 = quants(arr[mid:])
    else:
        Q3 = quants(arr[mid+1:])
    
    return [Q1, Q2, Q3]

def quants(a):
    n = len(a)
    mid = n // 2
    
    if n % 2 != 0:
        median = a[mid]
    else:
        median = (a[mid] + a[~mid]) / 2
        
    return round(median)

  • hoiconandoyle
     + 0 comments
    def median(data):
    num = len(data)
    if num % 2 == 0:
        return (data[num//2 - 1] + data[num//2]) / 2
    
    return data[(num-1) // 2]

def quartiles(arr):
    n = len(arr)
    arrX = sorted(arr)
    Q2 = median(arrX)
    
    if n % 2 != 0:
        Q1 = median(arrX[:(n-1)//2])
        Q3 = median(arrX[(n+1)//2:])
    else:
        Q1 = median(arrX[:(n//2)])
        Q3 = median(arrX[(n//2):])
    
    return int(Q1), int(Q2), int(Q3)