Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6952291
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T14:19:47+00:00 2026-05-27T14:19:47+00:00

The following algorithm is supposed to calculate the 2nd degree equation root, but compiling

  • 0

The following algorithm is supposed to calculate the 2nd degree equation root, but compiling it produces a compiling error.
I copied it from a tutorial.

2 roota.hs:5:20: parse error on input `='

roots (a,b,c) = 
        if d < 0 then error "sorry" else (x1, x2)
        where x1 = e + sqrt d / (2 * a)
            x2 = e - sqrt d / (2 * a)
            d = b * b - 4 * a * c
            e = - b / (2 *a)

Thanks for the answers.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T14:19:48+00:00Added an answer on May 27, 2026 at 2:19 pm

    It’s a problem with indentation. Try

    roots (a,b,c) = 
             if d < 0 then error "sorry" else (x1, x2)
             where
               x1 = e + sqrt d / (2 * a)
               x2 = e - sqrt d / (2 * a)
               d = b * b - 4 * a * c
               e = - b / (2 *a)
    

    See also a question about indentation and and an article from a Haskell Wikibook.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Why is the following algorithm not halting for me? In the code below, str
Here's the following algorithm: int encryption(int a, int b) { short int c, c2;
I have a SP that has the following algorithm. IF <SomeCondition> BEGIN SELECT *
I am currently using the following algorithm to search on my iPhone app: NSRange
We are doing some 32bit * 32bit multiplication using the following algorithm Let us
Which checksum algorithm can you recommend in the following use case? I want to
What is the best compression algorithm with the following features: should take less time
Is there an algorithm for figuring out the following things? If the result of
I have an algorithm that recursively makes change in the following manner: public static
What would be the best hashing algorithm if we had the following priorities (in

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.